QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#310340 | #4996. Icy Itinerary | 11d10xy | WA | 1ms | 4028kb | C++14 | 791b | 2024-01-21 11:32:14 | 2024-01-21 11:32:14 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int n,m;
set<pair<int,int>>e;
list<int>ans{1,2};
int main(){
cin>>n>>m;
for(int u,v;m--;)scanf("%d%d",&u,&v),e.emplace(u,v),e.emplace(v,u);
auto it=prev(end(ans));
for(int i=3;i<=n;i++)if(next(it)==end(ans)){
ans.insert(end(ans),i);
if(e.count({*it,*prev(it)})==e.count({i,*it}))it++;
}else{
int x=e.count({*prev(it),*it}),y=e.count({*it,i}),z=e.count({*it,*next(it)}),a=e.count({*prev(it),i}),b=e.count({*next(it),i});
if(y==b)it=ans.insert(next(it),i),y==z?it--:it++;
else if(z==b)it=ans.insert(next(it),i);
else if(x==y)it=prev(ans.insert(it,i));
else it=ans.insert(it,i);
if(it==begin(ans))it=prev(end(ans));
}for(int x:ans)printf("%d ",x);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3740kb
input:
4 4 1 2 1 3 1 4 3 4
output:
1 4 2 3
result:
ok qwq
Test #2:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
5 0
output:
1 2 3 4 5
result:
ok qwq
Test #3:
score: 0
Accepted
time: 1ms
memory: 4020kb
input:
10 10 7 8 7 5 5 2 6 1 10 7 4 6 5 8 3 2 10 5 1 10
output:
1 2 4 3 5 6 7 9 8 10
result:
ok qwq
Test #4:
score: 0
Accepted
time: 0ms
memory: 4028kb
input:
2 1 1 2
output:
1 2
result:
ok qwq
Test #5:
score: 0
Accepted
time: 1ms
memory: 3948kb
input:
2 0
output:
1 2
result:
ok qwq
Test #6:
score: 0
Accepted
time: 0ms
memory: 4012kb
input:
3 1 1 3
output:
1 2 3
result:
ok qwq
Test #7:
score: 0
Accepted
time: 0ms
memory: 3832kb
input:
10 40 10 9 4 5 2 7 3 4 4 7 4 9 7 3 5 10 5 9 8 1 1 10 6 7 6 9 9 8 10 7 7 8 8 3 10 3 2 1 1 5 6 1 5 7 2 5 3 9 2 8 1 9 4 1 1 7 4 10 2 10 3 1 4 6 9 7 3 6 2 3 8 4 6 8 3 5 4 2 2 6
output:
1 2 3 4 5 7 6 8 9 10
result:
ok qwq
Test #8:
score: 0
Accepted
time: 0ms
memory: 3744kb
input:
10 45 7 2 6 3 7 10 5 1 1 9 6 8 10 1 2 10 10 8 10 5 6 2 4 3 6 7 10 3 3 2 1 8 10 9 2 5 9 2 4 1 8 3 8 2 5 7 4 8 9 4 1 7 7 3 6 10 4 2 6 4 10 4 3 1 8 5 4 7 1 6 9 5 3 9 6 5 5 4 9 7 2 1 8 9 3 5 6 9 7 8
output:
1 2 3 4 5 6 7 8 9 10
result:
ok qwq
Test #9:
score: -100
Wrong Answer
time: 1ms
memory: 3756kb
input:
15 40 12 11 11 6 5 11 15 14 10 14 15 5 1 11 10 12 4 3 6 4 4 9 2 11 6 12 13 7 7 9 10 9 1 2 9 11 2 6 7 14 2 9 3 13 9 1 2 7 8 11 1 10 13 1 4 15 3 7 2 15 6 5 10 15 4 14 15 6 2 4 3 11 1 14 2 8 1 8 10 7
output:
1 2 4 7 9 11 12 10 14 15 13 8 6 3 5
result:
wrong answer Changed color too many times (3)