QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#509189	#6315. 填数游戏	kymmykym	0	849ms	282716kb	C++14	1.7kb	2024-08-08 11:48:04	2024-08-08 11:48:04

Judging History

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

[2024-08-08 11:48:04]
评测

测评结果：0
用时：849ms
内存：282716kb

查看

[2024-08-08 11:48:04]
提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long 
const int maxn=2000005;
int n,m;
vector<int> S[maxn], T[maxn]; 
typedef pair<int,int>pi;
vector<pi>adj[maxn];

bool vis[maxn];
bool slf[maxn];
int in[maxn];
void solve(){
	cin >> n >> m;
	for(int i=1;i<=n;i++){
		T[i].clear();
		S[i].clear();
	}
	for(int i=1;i<=2*m;i++){
		adj[i].clear();
		vis[i]=slf[i]=in[i]=0;
	}
	for(int i=1;i<=n;i++){
		int num; cin >> num;
		for(int j=1;j<=num;j++){
			int x; cin >> x;
			S[i].push_back(x);
		}
	}
	for(int i=1;i<=n;i++){
		int num; cin >> num;
		for(int j=1;j<=num;j++){
			int x; cin >> x;
			T[i].push_back(x);
		}
	}
	
	for(int i=1;i<=n;i++){
		if(T[i].size() == 1){
			if(slf[T[i][0]]){
				cout<<-1<<"\n";return;
			}
			slf[T[i][0]]=1;
			adj[T[i][0]].push_back({T[i][0]+m,i});
			adj[T[i][0]].push_back({T[i][0]+m,i});
			in[T[i][0]]=2;
			adj[T[i][0]+m].push_back({T[i][0],i});
			adj[T[i][0]+m].push_back({T[i][0],i});
			in[T[i][0]+m]=2;
		} else{
			adj[T[i][0]].push_back({T[i][1],i});
			in[T[i][0]]++;
			adj[T[i][1]].push_back({T[i][0],i});
			in[T[i][1]]++;
		}
	}
	queue<int>qu;
	for(int i=1;i<=2*m;i++){
		if(in[i] == 1){
			qu.push(i);
			vis[i]=1;
		}
	}
	while(qu.size()){
		int cur=qu.front();qu.pop();
		for(auto v:adj[cur]){
			if(!vis[v.first]){
				in[v.first]--;
				if(in[v.first]==1){
					qu.push(v.first);
					vis[v.first]=1;
				}
			}
		}
	}
	bool can=1;
	for(int i=1;i<=2*m;i++){
		if(!vis[i])can&=(in[i]==2||in[i]==0);
	}
	
	if(!can)cout<<-1<<"\n";
	else cout<<0<<"\n";
	
}
int32_t main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	int tc; cin >> tc;
	while(tc--)solve();
}

源文件, 语言: C++14

詳細信息

Pretests

Final Tests

Test #1:

score: 0

Wrong Answer

time: 16ms

memory: 144492kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '4', found: '0'

Test #2:

score: 0

Wrong Answer

time: 20ms

memory: 145048kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '3', found: '0'

Test #3:

score: 0

Wrong Answer

time: 19ms

memory: 146184kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '6', found: '0'

Test #4:

score: 0

Wrong Answer

time: 24ms

memory: 145920kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '3', found: '0'

Test #5:

score: 0

Wrong Answer

time: 15ms

memory: 145516kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '3', found: '0'

Test #6:

score: 0

Wrong Answer

time: 24ms

memory: 144876kb

input:

output:

result:

wrong answer 23rd numbers differ - expected: '-1', found: '0'

Test #7:

score: 0

Wrong Answer

time: 21ms

memory: 145004kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '3', found: '0'

Test #8:

score: 0

Wrong Answer

time: 14ms

memory: 145888kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '1', found: '0'

Test #9:

score: 0

Wrong Answer

time: 27ms

memory: 150112kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '3', found: '0'

Test #10:

score: 0

Wrong Answer

time: 24ms

memory: 145400kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '6', found: '0'

Test #11:

score: 0

Wrong Answer

time: 20ms

memory: 145148kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '3', found: '0'

Test #12:

score: 0

Wrong Answer

time: 39ms

memory: 146404kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '38', found: '0'

Test #13:

score: 0

Wrong Answer

time: 45ms

memory: 144984kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '41', found: '0'

Test #14:

score: 0

Wrong Answer

time: 143ms

memory: 167584kb

input:

output:

-1
0
-1
-1
-1
0
-1
-1
-1
-1
-1
0
0
0
-1
0
0
-1
0
-1
-1
-1
-1
0
0
0
0
-1
-1
-1
-1
-1
0
-1
-1
-1
-1
0
0
-1
-1
-1
-1
-1
-1
-1
-1
0
0
0
-1
0
-1
0
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
0
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
0
-1
-1
-1
-1
0
-1
-1
0
0
-1
-1
-1
-1
-1
0
-1
-1
0
0
-1
-1
-1
0
0
-1
-1
-1
-1
-1
-1
...

result:

wrong answer 19th numbers differ - expected: '-1', found: '0'

Test #15:

score: 0

Wrong Answer

time: 95ms

memory: 167888kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '22', found: '0'

Test #16:

score: 0

Wrong Answer

time: 93ms

memory: 169928kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '21', found: '0'

Test #17:

score: 0

Wrong Answer

time: 114ms

memory: 169436kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '28', found: '0'

Test #18:

score: 0

Wrong Answer

time: 135ms

memory: 171416kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '32', found: '0'

Test #19:

score: 0

Wrong Answer

time: 103ms

memory: 163964kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '48', found: '0'

Test #20:

score: 0

Wrong Answer

time: 107ms

memory: 160960kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '48', found: '0'

Test #21:

score: 0

Wrong Answer

time: 115ms

memory: 171380kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '34', found: '0'

Test #22:

score: 0

Wrong Answer

time: 123ms

memory: 171244kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '33', found: '0'

Test #23:

score: 0

Wrong Answer

time: 838ms

memory: 282716kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '32', found: '0'

Test #24:

score: 0

Wrong Answer

time: 849ms

memory: 282176kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '37', found: '0'

Test #25:

score: 0

Wrong Answer

time: 835ms

memory: 282464kb

input:

output:

result:

wrong answer 1st numbers differ - expected: '38', found: '0'