Submission #4007452


Source Code Expand

#include <bits/stdc++.h>
#define eb emplace_back
#define sz(V) ((int)(V).size())
using namespace std;
typedef pair<int, int> pii;

struct EDG {
	EDG(int a, int b, int c)
		: a(a), b(b), c(c) {}
	int a, b, c;
	void prt() { printf("%d %d %d\n", a, b, c); }
};

vector<EDG> EV;

int N;

int main() {
	cin >> N;

	for(int i = 1; i < 19; i++) {
		EV.eb(i, i+1, 0);
		EV.eb(i, i+1, 1<<(i-1));
	}
	for(int i = 19; i; i--) {
		for(int c = 1<<(i-1); c <= N;) {
			EV.eb(i, 20, N-c);
			N -= c;
		}
	}

	printf("20 %d\n", sz(EV));
	for(auto &v : EV) v.prt();
	return 0;
}

Submission Info

Submission Time
Task D - All Your Paths are Different Lengths
User youngyojun
Language C++14 (GCC 5.4.1)
Score 700
Code Size 595 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 2
AC × 22
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 1 ms 256 KB
02.txt AC 1 ms 256 KB
03.txt AC 1 ms 256 KB
04.txt AC 1 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 1 ms 256 KB
07.txt AC 1 ms 256 KB
08.txt AC 1 ms 256 KB
09.txt AC 1 ms 256 KB
10.txt AC 1 ms 256 KB
11.txt AC 1 ms 256 KB
12.txt AC 1 ms 256 KB
13.txt AC 1 ms 256 KB
14.txt AC 1 ms 256 KB
15.txt AC 1 ms 256 KB
16.txt AC 1 ms 256 KB
17.txt AC 1 ms 256 KB
18.txt AC 1 ms 256 KB
19.txt AC 1 ms 256 KB
20.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB