QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#249407	#7640. Colorful Cycles	manizare	WA	86ms	5588kb	C++14	991b	2023-11-12 05:48:11	2023-11-12 05:48:11

Judging History

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

[2024-07-04 22:58:32]
hack成功，自动添加数据
(/hack/728)

[2023-11-12 05:48:11]
评测

测评结果：WA
用时：86ms
内存：5588kb

查看

[2023-11-12 05:48:11]
提交

answer

#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second 
#define all(a) a.begin(),a.end()
#define pii pair <int,int>
#define PII pair<pii , pii>
#define int long long
#define sz(v) (int)v.size()
using namespace std ;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 2e6 + 10 , inf  = 1e18 , lg = 21 ;  
int mark[maxn] , d[maxn][4] ;
signed main(){ 
  	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0) ;
	int T ;
	cin >> T ;
	while(T--){
		int n , m ;
		cin >> n >> m ;
		for(int i = 1 ; i<= n; i++){
			for(int j = 1; j <= 3; j ++){
				d[i][j] = 0;
				mark[j] =0 ;
			}
		}
		for(int i = 1; i <= m; i++){
			int v , u , c;
			cin >> v >> u >> c;
			d[v][c] = d[u][c] = 1 ;
			mark[c]= 1;
		}
		int ted= 0 ;
		for(int i = 1; i <= n; i++){
			if((d[i][3]+d[i][1]+d[i][2])>=2){ted++;}
		}
		if(ted >= 3 && mark[1]&& mark[2]&&mark[3])cout << "Yes\n";
		else cout << "No\n"; 
	}
}
/* 
 
 
*/

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 1ms

memory: 5448kb

input:

output:

Yes
No

result:

ok 2 token(s): yes count is 1, no count is 1

Test #2:

score: -100

Wrong Answer

time: 86ms

memory: 5588kb

input:

output:

Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
...

result:

wrong answer expected NO, found YES [131st token]