QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #546746 | #4829. Mark on a Graph | luqyou | 0 | 0ms | 0kb | C++14 | 893b | 2024-09-04 12:52:34 | 2024-09-04 12:52:34 |
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 maxx=0,maxi=0;
for(int i=1;i<=n;i++){
if(d[i]>maxx) maxx=d[i],maxi=i;
}
if(maxx>=13) return cout<<"ok"<<endl,void();
cout<<"mark"<<endl;
cout<<5<<endl;
for(int i=1;i<=n;i++){
if(i==maxi||f[i][maxi]) continue;
cout<<i<<" "<<maxi<<endl;
}
}
int main(){
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，尤其是后缀名
检查空间
检查调试语句是否全部注释
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer on the first run
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:
ok
input:
output:
result:
wrong answer Token "ok" doesn't correspond to pattern "mark"