QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#329970#8056. Travel 2ucup-team266#AC ✓274ms4172kbC++232.1kb2024-02-17 10:05:372024-02-17 10:05:40

Judging History

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

  • [2024-02-17 10:05:40]
  • 评测
  • 测评结果:AC
  • 用时:274ms
  • 内存:4172kb
  • [2024-02-17 10:05:37]
  • 提交

answer

//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
vector<int> G[3030];
int deg[3030];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	{
		for(int i=1;i<=2500;i++)
			G[i].clear();
		memset(deg,-1,sizeof(deg));
		vector<int> trace;
		int lx=-1,lp=-1;
		while(true)
		{
			int x,d;
			cin>>x>>d;
			if(deg[x]<0)
				deg[x]=d;
			if(*max_element(deg+1,deg+2501)<=0) break;
			if(lx!=-1)
			{
				if(!G[lx][lp-1])
					deg[lx]--;
				G[lx][lp-1]=x;
			}
			int ph=-1;
			for(int i=0;i<sz(trace);i++)
				if(trace[i]==x)
					ph=i;
			if(ph!=-1)
			{
				bool flag=1;
				for(int i=ph+1;i<sz(trace);i++)
					if(deg[trace[i]])
					{
						flag=0;
						break;
					}
				if(flag)
				{
					while(trace.back()!=x)
						trace.pop_back();
					trace.pop_back();
				}
			}
			if(!sz(G[x]))
				G[x].resize(d);
			bool flag=0;
			for(int i=1;i<=d;i++)
				if(!G[x][i-1])
				{
					flag=1;
					cout<<"> "<<i<<endl;
					lx=x;
					lp=i;
					trace.pb(x);
					break;
				}
			if(!flag)
			{
				if(!sz(trace)) break;
				for(int i=1;i<=d;i++)
					if(G[x][i-1]==trace.back())
					{
						cout<<"> "<<i<<endl;
						lx=-1;
						lp=-1;
						trace.pop_back();
						break;
					}
			}
		}
		vector<pii> ans;
		for(int i=1;i<=2500;i++)
			for(auto j:G[i])
				if(i<j)
					ans.pb(i,j);
		cout<<"!";
		for(auto pr:ans)
			cout<<" "<<pr.first<<" "<<pr.second;
		cout<<endl;
		string s;
		cin>>s;
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3740kb

input:

2
1 1
2 1
1 1
Correct
1 3
2 2
1 3
3 1
1 3
4 2
1 3
4 2
2 2
4 2
2 2
Correct

output:

> 1
> 1
! 1 2
> 1
> 1
> 2
> 1
> 3
> 1
> 3
> 2
> 2
> 2
! 1 2 1 3 1 4 2 4

result:

ok correct

Test #2:

score: 0
Accepted
time: 274ms
memory: 3548kb

input:

1000
1 9
2 7
1 9
3 9
1 9
4 9
1 9
5 8
1 9
6 9
1 9
7 7
1 9
8 8
1 9
9 8
1 9
10 6
1 9
10 6
2 7
3 9
4 9
3 9
9 8
3 9
2 7
10 6
8 8
5 8
8 8
10 6
4 9
7 7
4 9
10 6
6 9
2 7
6 9
10 6
3 9
5 8
9 8
5 8
2 7
5 8
3 9
10 6
3 9
8 8
9 8
2 7
9 8
8 8
7 7
8 8
3 9
7 7
5 8
6 9
5 8
7 7
3 9
6 9
8 8
6 9
3 9
6 9
9 8
7 7
9 8
6 9
...

output:

> 1
> 1
> 2
> 1
> 3
> 1
> 4
> 1
> 5
> 1
> 6
> 1
> 7
> 1
> 8
> 1
> 9
> 1
> 9
> 2
> 2
> 2
> 2
> 3
> 2
> 4
> 3
> 3
> 2
> 2
> 3
> 4
> 3
> 2
> 4
> 5
> 2
> 4
> 3
> 6
> 5
> 3
> 3
> 4
> 5
> 5
> 6
> 6
> 7
> 4
> 4
> 6
> 5
> 5
> 3
> 6
> 8
> 4
> 6
> 4
> 7
> 5
> 9
> 5
> 7
> 6
> 9
> 7
> 6
> 6
> 7
> 8
> 7
> 9
> 5
...

result:

ok correct

Test #3:

score: 0
Accepted
time: 189ms
memory: 3544kb

input:

500
1 19
2 8
1 19
3 7
1 19
4 8
1 19
5 7
1 19
6 7
1 19
7 11
1 19
8 4
1 19
9 7
1 19
10 9
1 19
11 8
1 19
12 7
1 19
13 4
1 19
14 9
1 19
15 8
1 19
16 7
1 19
17 10
1 19
18 7
1 19
19 7
1 19
20 6
1 19
20 6
3 7
20 6
15 8
20 6
9 7
4 8
3 7
11 8
3 7
4 8
12 7
4 8
7 11
5 7
7 11
16 7
13 4
16 7
11 8
8 4
11 8
16 7
7...

output:

> 1
> 1
> 2
> 1
> 3
> 1
> 4
> 1
> 5
> 1
> 6
> 1
> 7
> 1
> 8
> 1
> 9
> 1
> 10
> 1
> 11
> 1
> 12
> 1
> 13
> 1
> 14
> 1
> 15
> 1
> 16
> 1
> 17
> 1
> 18
> 1
> 19
> 1
> 19
> 2
> 2
> 3
> 2
> 4
> 2
> 2
> 3
> 2
> 4
> 3
> 2
> 4
> 2
> 2
> 3
> 2
> 2
> 3
> 3
> 2
> 4
> 4
> 4
> 5
> 5
> 6
> 3
> 2
> 2
> 3
> 2
> 2
>...

result:

ok correct

Test #4:

score: 0
Accepted
time: 151ms
memory: 3564kb

input:

100
1 99
2 5
1 99
3 5
1 99
4 10
1 99
5 3
1 99
6 9
1 99
7 6
1 99
8 8
1 99
9 9
1 99
10 5
1 99
11 4
1 99
12 7
1 99
13 6
1 99
14 8
1 99
15 7
1 99
16 7
1 99
17 7
1 99
18 6
1 99
19 10
1 99
20 4
1 99
21 4
1 99
22 5
1 99
23 6
1 99
24 10
1 99
25 4
1 99
26 10
1 99
27 7
1 99
28 6
1 99
29 11
1 99
30 5
1 99
31 7...

output:

> 1
> 1
> 2
> 1
> 3
> 1
> 4
> 1
> 5
> 1
> 6
> 1
> 7
> 1
> 8
> 1
> 9
> 1
> 10
> 1
> 11
> 1
> 12
> 1
> 13
> 1
> 14
> 1
> 15
> 1
> 16
> 1
> 17
> 1
> 18
> 1
> 19
> 1
> 20
> 1
> 21
> 1
> 22
> 1
> 23
> 1
> 24
> 1
> 25
> 1
> 26
> 1
> 27
> 1
> 28
> 1
> 29
> 1
> 30
> 1
> 31
> 1
> 32
> 1
> 33
> 1
> 34
> 1
> 3...

result:

ok correct

Test #5:

score: 0
Accepted
time: 263ms
memory: 3824kb

input:

10
1 999
2 8
1 999
3 9
1 999
4 8
1 999
5 7
1 999
6 7
1 999
7 4
1 999
8 4
1 999
9 13
1 999
10 11
1 999
11 7
1 999
12 7
1 999
13 5
1 999
14 5
1 999
15 8
1 999
16 9
1 999
17 5
1 999
18 5
1 999
19 8
1 999
20 4
1 999
21 8
1 999
22 8
1 999
23 6
1 999
24 8
1 999
25 2
1 999
26 9
1 999
27 5
1 999
28 6
1 999
...

output:

> 1
> 1
> 2
> 1
> 3
> 1
> 4
> 1
> 5
> 1
> 6
> 1
> 7
> 1
> 8
> 1
> 9
> 1
> 10
> 1
> 11
> 1
> 12
> 1
> 13
> 1
> 14
> 1
> 15
> 1
> 16
> 1
> 17
> 1
> 18
> 1
> 19
> 1
> 20
> 1
> 21
> 1
> 22
> 1
> 23
> 1
> 24
> 1
> 25
> 1
> 26
> 1
> 27
> 1
> 28
> 1
> 29
> 1
> 30
> 1
> 31
> 1
> 32
> 1
> 33
> 1
> 34
> 1
> 3...

result:

ok correct

Test #6:

score: 0
Accepted
time: 240ms
memory: 3828kb

input:

4
1 999
2 24
1 999
3 20
1 999
4 17
1 999
5 29
1 999
6 21
1 999
7 21
1 999
8 19
1 999
9 21
1 999
10 14
1 999
11 12
1 999
12 17
1 999
13 23
1 999
14 23
1 999
15 16
1 999
16 14
1 999
17 16
1 999
18 15
1 999
19 16
1 999
20 19
1 999
21 16
1 999
22 16
1 999
23 25
1 999
24 23
1 999
25 22
1 999
26 16
1 999
...

output:

> 1
> 1
> 2
> 1
> 3
> 1
> 4
> 1
> 5
> 1
> 6
> 1
> 7
> 1
> 8
> 1
> 9
> 1
> 10
> 1
> 11
> 1
> 12
> 1
> 13
> 1
> 14
> 1
> 15
> 1
> 16
> 1
> 17
> 1
> 18
> 1
> 19
> 1
> 20
> 1
> 21
> 1
> 22
> 1
> 23
> 1
> 24
> 1
> 25
> 1
> 26
> 1
> 27
> 1
> 28
> 1
> 29
> 1
> 30
> 1
> 31
> 1
> 32
> 1
> 33
> 1
> 34
> 1
> 3...

result:

ok correct

Test #7:

score: 0
Accepted
time: 244ms
memory: 3804kb

input:

4
1 199
2 106
1 199
3 95
1 199
4 102
1 199
5 103
1 199
6 103
1 199
7 110
1 199
8 109
1 199
9 104
1 199
10 98
1 199
11 85
1 199
12 94
1 199
13 86
1 199
14 105
1 199
15 102
1 199
16 96
1 199
17 97
1 199
18 94
1 199
19 112
1 199
20 108
1 199
21 116
1 199
22 109
1 199
23 104
1 199
24 96
1 199
25 92
1 19...

output:

> 1
> 1
> 2
> 1
> 3
> 1
> 4
> 1
> 5
> 1
> 6
> 1
> 7
> 1
> 8
> 1
> 9
> 1
> 10
> 1
> 11
> 1
> 12
> 1
> 13
> 1
> 14
> 1
> 15
> 1
> 16
> 1
> 17
> 1
> 18
> 1
> 19
> 1
> 20
> 1
> 21
> 1
> 22
> 1
> 23
> 1
> 24
> 1
> 25
> 1
> 26
> 1
> 27
> 1
> 28
> 1
> 29
> 1
> 30
> 1
> 31
> 1
> 32
> 1
> 33
> 1
> 34
> 1
> 3...

result:

ok correct

Test #8:

score: 0
Accepted
time: 141ms
memory: 4172kb

input:

4
1 140
2 140
1 140
3 140
1 140
4 140
1 140
5 140
1 140
6 140
1 140
7 140
1 140
8 140
1 140
9 140
1 140
10 140
1 140
11 140
1 140
12 140
1 140
13 140
1 140
14 140
1 140
15 140
1 140
16 140
1 140
17 140
1 140
18 140
1 140
19 140
1 140
20 140
1 140
21 140
1 140
22 140
1 140
23 140
1 140
24 140
1 140
2...

output:

> 1
> 1
> 2
> 1
> 3
> 1
> 4
> 1
> 5
> 1
> 6
> 1
> 7
> 1
> 8
> 1
> 9
> 1
> 10
> 1
> 11
> 1
> 12
> 1
> 13
> 1
> 14
> 1
> 15
> 1
> 16
> 1
> 17
> 1
> 18
> 1
> 19
> 1
> 20
> 1
> 21
> 1
> 22
> 1
> 23
> 1
> 24
> 1
> 25
> 1
> 26
> 1
> 27
> 1
> 28
> 1
> 29
> 1
> 30
> 1
> 31
> 1
> 32
> 1
> 33
> 1
> 34
> 1
> 3...

result:

ok correct

Test #9:

score: 0
Accepted
time: 92ms
memory: 3860kb

input:

4
1 2498
2 2
1 2498
3 2
1 2498
4 2
1 2498
5 2
1 2498
6 2
1 2498
7 2
1 2498
8 2
1 2498
9 2
1 2498
10 2
1 2498
11 2
1 2498
12 2
1 2498
13 2
1 2498
14 2
1 2498
15 2
1 2498
16 2
1 2498
17 2
1 2498
18 2
1 2498
19 2
1 2498
20 2
1 2498
21 2
1 2498
22 2
1 2498
23 2
1 2498
24 2
1 2498
25 2
1 2498
26 2
1 2498...

output:

> 1
> 1
> 2
> 1
> 3
> 1
> 4
> 1
> 5
> 1
> 6
> 1
> 7
> 1
> 8
> 1
> 9
> 1
> 10
> 1
> 11
> 1
> 12
> 1
> 13
> 1
> 14
> 1
> 15
> 1
> 16
> 1
> 17
> 1
> 18
> 1
> 19
> 1
> 20
> 1
> 21
> 1
> 22
> 1
> 23
> 1
> 24
> 1
> 25
> 1
> 26
> 1
> 27
> 1
> 28
> 1
> 29
> 1
> 30
> 1
> 31
> 1
> 32
> 1
> 33
> 1
> 34
> 1
> 3...

result:

ok correct

Extra Test:

score: 0
Extra Test Passed