oj.uz

답안 #478213

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
478213 2021-10-06T13:34:56 Z NachoLibre Konstrukcija (COCI20_konstrukcija) C++17
50 / 110
 2 ms 592 KB 
#include <bits/stdc++.h>
#define ll long long
#define sz(x) ((int)x.size())
using namespace std;

int n = 1;
vector<int> lr{1};
vector<pair<int, int>> fp;
void add3(int x) {
	fp.push_back({1, ++n});
	fp.push_back({1, ++n});
	fp.push_back({1, ++n});
	for(int i = 1; i < x; ++i) {
		n += 3;
		for(int i = 0; i < 3; ++i) {
			for(int j = 0; j < 3; ++j) {
				fp.push_back({n - 3 - i, n - j});
			}
		}
	}
	lr.push_back(n - 0);
	lr.push_back(n - 1);
	lr.push_back(n - 2);
}
void add1() {
	fp.push_back({1, ++n});
	lr.push_back(n);
}
void sub1() {
	fp.push_back({1, ++n});
	fp.push_back({1, ++n});
	n += 3;
	for(int i = 0; i < 2; ++i) {
		for(int j = 0; j < 3; ++j) {
			fp.push_back({n - 3 - i, n - j});
		}
	}
	lr.push_back(n - 0);
	lr.push_back(n - 1);
	lr.push_back(n - 2);
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	long long x = 3;
	vector<pair<long long, int>> v[2];
	for(int i = 1; i <= 60; ++i) {
		v[x > 0].push_back({x, i});
		x = - x * 2 + 3;
	}
	long long k;
	cin >> k; ++k;
	int a = 1;
	if(k < 0) a = 0;
	for(int i = sz(v[a]) - 1; i >= 0; --i) {
		long long x = v[a][i].first;
		int y = v[a][i].second;
		while(abs(x) <= abs(k)) {
			k -= x;
			add3(y);
		}
	}
	while(k) {
		if(k > 0) --k, add1();
		else ++k, sub1();
	}
	++n;
	for(int i = 0; i < sz(lr); ++i) {
		fp.push_back({lr[i], n});
	}
	cout << n << " " << sz(fp) << "\n";
	for(int i = 0; i < sz(fp); ++i) {
		cout << fp[i].first << " " << fp[i].second << "\n";
	}
	return 0;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Correct.
2 Correct 1 ms 320 KB Correct.
3 Correct 0 ms 208 KB Correct.
4 Correct 1 ms 208 KB Correct.
5 Correct 1 ms 208 KB Correct.

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Correct.
2 Correct 0 ms 204 KB Correct.
3 Correct 1 ms 208 KB Correct.
4 Correct 1 ms 208 KB Correct.
5 Correct 0 ms 208 KB Correct.

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Correct.
2 Correct 1 ms 320 KB Correct.
3 Correct 0 ms 208 KB Correct.
4 Correct 1 ms 208 KB Correct.
5 Correct 1 ms 208 KB Correct.
6 Correct 0 ms 204 KB Correct.
7 Correct 0 ms 204 KB Correct.
8 Correct 1 ms 208 KB Correct.
9 Correct 1 ms 208 KB Correct.
10 Correct 0 ms 208 KB Correct.
11 Correct 0 ms 208 KB Correct.
12 Correct 1 ms 336 KB Correct.
13 Correct 1 ms 336 KB Correct.
14 Correct 1 ms 208 KB Correct.
15 Correct 0 ms 208 KB Correct.

Subtask #4
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Correct.
2 Correct 1 ms 320 KB Correct.
3 Correct 0 ms 208 KB Correct.
4 Correct 1 ms 208 KB Correct.
5 Correct 1 ms 208 KB Correct.
6 Correct 0 ms 204 KB Correct.
7 Correct 0 ms 204 KB Correct.
8 Correct 1 ms 208 KB Correct.
9 Correct 1 ms 208 KB Correct.
10 Correct 0 ms 208 KB Correct.
11 Correct 0 ms 208 KB Correct.
12 Correct 1 ms 336 KB Correct.
13 Correct 1 ms 336 KB Correct.
14 Correct 1 ms 208 KB Correct.
15 Correct 0 ms 208 KB Correct.
16 Incorrect 2 ms 592 KB Integer parameter [name=N] equals to 3305, violates the range [1, 1000]
17 Halted 0 ms 0 KB -