QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#318688#7743. Grand Finalemosaev#WA 0ms8376kbC++231.2kb2024-01-31 17:03:572024-01-31 17:03:57

Judging History

This is the latest submission verdict.

  • [2024-01-31 17:03:57]
  • Judged
  • Verdict: WA
  • Time: 0ms
  • Memory: 8376kb
  • [2024-01-31 17:03:57]
  • Submitted

answer

//#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define N ((ll)1e6+5)
#define M ((ll)1e9+7)
#define fi first
#define se second
#define bs ((ll)1+1)
#define pb push_back
const int X = 1e5 + 10;
vector<int> vec[X];
set<int> st[X];

void solve() {
	int n, m;
	cin >> n >> m;
	for (int i = 0; i <= m; i++)
		vec[i].clear(), st[i].clear();
	for (int i = 1; i <= n; i++) {
		int p; cin >> p;
		for (int j = 0; j < p; j++) {
			int x; cin >> x;
			vec[x].push_back(i);
		}
	}
	for (int i = 1; i <= m; i++) {
		for (auto u : vec[i]) {
			st[u].insert(vec[i].back());
		}
	}
	for (int i = 1; i < n; i++) {
		if (st[i].count(i + 1) == 0) {
			cout << "Yes" << '\n';
			for (int j = 1; j < i; j++)
				cout << j << ' ';
			cout << i + 1 << ' ' << i;
			for (int j = i + 2; j <= n; j++)
				cout << ' ' << j;
			cout << '\n';		
			return;

		}
	}
	cout << "No" << '\n';
}

int main() {
#define int ll
	ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	int tc; cin >> tc;
	while (tc--)
		solve();
	return 0;
	
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 8376kb

input:

2
2 6
BG
BQWBWW
4 6
GQBW
WWWWQB

output:

Yes
2 1
Yes
2 1

result:

wrong answer 1st lines differ - expected: '3', found: 'Yes'