QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#329970	#8056. Travel 2	ucup-team266^#	AC ✓	274ms	4172kb	C++23	2.1kb	2024-02-17 10:05:37	2024-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;
}

源文件, 语言: C++23

詳細信息

Test #1:

score: 100

Accepted

time: 1ms

memory: 3740kb

input:

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:

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:

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:

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:

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:

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:

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:

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:

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