NOI批量评测 - 记录详情

foo.cc: In function 'int Sol1::main()':
foo.cc:22:25: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   22 |                         if(l1>r1)swap(l1,r1);if(l2>r2)swap(l2,r2);
      |                         ^~
foo.cc:22:46: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   22 |                         if(l1>r1)swap(l1,r1);if(l2>r2)swap(l2,r2);
      |                                              ^~
Expand

#	状态分数	耗时	内存占用

#1	Accepted 4	14ms	440 KiB
#2	Accepted 4	21ms	444 KiB
#3	Runtime Error 0 Segmentation fault	2ms	532 KiB
#4	Runtime Error 0 Segmentation fault	2ms	452 KiB
#5	Runtime Error 0 Segmentation fault	2ms	532 KiB
#6	Runtime Error 0 Segmentation fault	2ms	536 KiB
#7	Runtime Error 0 Segmentation fault	2ms	440 KiB
#8	Runtime Error 0 Segmentation fault	2ms	404 KiB
#9	Runtime Error 0 Segmentation fault	2ms	404 KiB
#10	Runtime Error 0 Segmentation fault	2ms	408 KiB
#11	Runtime Error 0 Segmentation fault	2ms	404 KiB
#12	Runtime Error 0 Segmentation fault	2ms	404 KiB
#13	Runtime Error 0 Segmentation fault	2ms	432 KiB
#14	Runtime Error 0 Segmentation fault	2ms	444 KiB
#15	Runtime Error 0 Segmentation fault	2ms	404 KiB
#16	Runtime Error 0 Segmentation fault	2ms	404 KiB
#17	Runtime Error 0 Segmentation fault	2ms	408 KiB
#18	Runtime Error 0 Segmentation fault	2ms	404 KiB
#19	Runtime Error 0 Segmentation fault	2ms	532 KiB
#20	Runtime Error 0 Segmentation fault	2ms	636 KiB
#21	Runtime Error 0 Segmentation fault	2ms	532 KiB
#22	Runtime Error 0 Segmentation fault	2ms	532 KiB
#23	Runtime Error 0 Segmentation fault	2ms	404 KiB
#24	Runtime Error 0 Segmentation fault	2ms	408 KiB
#25	Runtime Error 0 Segmentation fault	2ms	636 KiB

#include <bits/stdc++.h>
using namespace std;

int c,t;

namespace Sol1{
    int a[15],b[15],u[30],v[30];
    int main(){
        int n,m;
        while(t--){
            cin>>n>>m;
            for(int i=1;i<=m;i++)
                cin>>u[i]>>v[i];
            for(int i=1;i<=n;i++)
                a[i]=i;
            do{
                for(int i=1;i<=n;i++)b[a[i]]=i;
                bool f=true;
                for(int i=1;i<=m && f;i++){
                    for(int j=1;j<=m && f;j++){
                        int l1=b[u[i]],r1=b[v[i]],l2=b[u[j]],r2=b[v[j]];
                        if(l1>r1)swap(l1,r1);if(l2>r2)swap(l2,r2);
                        if(l1<l2 && l2<r1 && r1<r2)f=false;
                    }
                }
                if(f)break;
            }while(next_permutation(a+1,a+n+1));
            for(int i=1;i<=n;i++)
                cout<<a[i]<<' ';
            cout<<'\n';
        }
        return 0;
    }
}

int main(){
    ios::sync_with_stdio(false);cin.tie(nullptr);
    freopen("graperm.in","r",stdin);
    freopen("graperm.out","w",stdout);
    cin>>c>>t;Sol1::main();
    return 0;
}

递交者: JX-030
题目: NOISX2025GFC NOISX2025GFC
比赛: 【官方数据 JX】联合省选 2025 批量测试
语言: C++14(O2, GCC 9.3.0)
代码长度: 1.1 KiB
递交时间: 2025-3-6 22:57:06
评测时间: 2025-3-7 10:31:01

分数: 8
总耗时: 81ms
峰值时间: 21ms
峰值内存: 636 KiB

8 Runtime Error

代码

信息

还没有账户？

登录