QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#546759#4829. Mark on a Graphluqyou0 2ms7620kbC++141.3kb2024-09-04 13:07:142024-09-04 13:07:14

Judging History

你现在查看的是最新测评结果

  • [2024-09-04 13:07:14]
  • 评测
  • 测评结果:0
  • 用时:2ms
  • 内存:7620kb
  • [2024-09-04 13:07:14]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define fi first
#define sc second
#define pii pair<int,int>
#define pb push_back
const int maxn=1000+10;
int n,m,f[maxn][maxn],d[maxn];
void solve(){
    cin>>n>>m;
    for(int i=1,u,v;i<=m;i++) cin>>u>>v,f[u][v]=f[v][u]=1,d[u]++,d[v]++;
    int minn=1e9,mini=0;
    for(int i=1;i<=n;i++){
        if(d[i]<minn) minn=d[i],mini=i;
    }
    int cnt=0;
    for(int i=1;i<=n;i++) cnt+=(d[i]==minn);
    if(minn==0&&cnt>=2) return cout<<"ok"<<endl,void();
    cout<<"mark"<<endl;
    cout<<5<<endl;
    for(int i=1;i<=n;i++){
        if(d[i]==2){
            for(int j=1;j<=n;j++){
                if(f[i][j]) cout<<i<<" "<<j<<endl;
            }
            break;
        }
    }
    for(int i=1;i<=n;i++){
        if(d[i]==3){
            for(int j=1;j<=n;j++){
                if(f[i][j]) cout<<i<<" "<<j<<endl;
            }
            break;
        }
    }
}
int main(){
//	freopen("graph.in","r",stdin);
//	freopen("graph.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--) solve();
    return 0;
}
/*
Samples
input:

output:

THINGS TODO:
检查freopen,尤其是后缀名
检查空间
检查调试语句是否全部注释
*/

詳細信息

Test #1:

score: 100
Accepted
time: 2ms
memory: 7620kb

input:

1000 3560
603 151
415 20
102 569
895 552
678 734
24 614
689 518
440 223
751 919
223 433
711 551
502 634
706 583
812 501
514 535
780 751
720 530
532 384
888 139
864 791
292 675
171 881
30 592
464 557
280 299
654 650
894 335
250 532
792 10
83 969
118 771
579 300
852 983
243 940
957 939
817 889
911 319...

output:

mark
5
40 124
40 1000
32 456
32 575
32 779

input:

1000 3555
330 666
121 222
601 501
689 190
446 441
754 49
669 385
656 559
715 437
383 905
483 252
598 16
956 593
24 54
250 209
627 75
597 520
897 500
182 369
777 855
414 363
25 676
920 889
83 725
688 603
282 329
102 326
725 759
694 449
119 87
199 956
199 600
547 272
221 163
749 581
583 858
937 748
87...

output:

ok

result:

ok all right

Test #2:

score: 0
Wrong Answer on the first run

input:

1000 2000
457 335
160 497
464 992
892 255
853 3
308 301
970 363
541 299
89 418
425 128
626 827
603 854
484 874
755 295
607 483
798 552
356 850
320 357
254 940
675 901
168 525
301 636
520 555
773 910
343 701
889 966
218 529
909 950
71 64
682 284
424 138
721 792
670 544
386 72
654 909
725 235
592 437
...

output:

ok

input:


output:


result:

wrong answer Token "ok" doesn't correspond to pattern "mark"