QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#684610#8934. Challenge NPCreal_sigma_team#WA 0ms3764kbC++23651b2024-10-28 14:44:122024-10-28 14:44:13

Judging History

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

  • [2024-10-28 14:44:13]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3764kb
  • [2024-10-28 14:44:12]
  • 提交

answer

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

int main() {
	// std::cin.tie(nullptr)->sync_with_stdio(false);

	ll k;
	cin >> k;
	vector<ll> lst;
	ll nxt = 2;
	vector<pair<ll, ll>> all;
	lst.push_back(1);
	for (ll i = 0; i <= k; i++) {
		for (ll j = 0; j + 1 < lst.size(); j++) {
			all.emplace_back(lst[j], nxt);
		}
		all.emplace_back(nxt, nxt + 1);
		nxt++;
		lst.push_back(nxt);
		nxt++;
	}
	cout << nxt - 1 << ' ' << all.size() << ' ' << 2 << '\n';
	for (ll i = 1; i < nxt; i++) {
		cout << i % 2 + 1 << ' ';
	}
	cout << '\n';
	for (auto[a, b] : all) {
		cout << a << ' ' << b << '\n';
	}
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

1

output:

5 3 2
2 1 2 1 2 
2 3
1 4
4 5

result:

wrong answer The graph is not correct