oj.uz

Submission #204757

# Submission time Handle Problem Language Result Execution time Memory
204757 2020-02-26T23:35:00 Z mode149256 Xylophone (JOI18_xylophone) C++14
100 / 100
 125 ms 456 KB 
/*input
1
4
2
1
4
4
2

2, 1, 5, 3, 4
*/
#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;

typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;

#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"

const int MOD = 1000000007;
const ll INF = std::numeric_limits<ll>::max();
const int MX = 100101;
const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;

template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }

template<typename T>
void print(vector<T> vec, string name = "") {
	cout << name;
	for (auto u : vec)
		cout << u << ' ';
	cout << '\n';
}


// int query(int s, int t) {
// 	int ret;
// 	cin >> ret;
// 	return ret;
// }

// vi final(MX);
// void answer(int i, int a) {
// 	final[i - 1] = a;
// }

void solve(int N) {
	vi kiek(N - 1);
	for (int i = 0; i < N - 1; ++i)
		kiek[i] = query(i + 1, i + 2);

	vi ats(N);

	vi tri(N);
	ats[0] = 0;
	ats[1] = kiek[0];

	bool inc = true;

	for (int i = 0; i < N - 2; ++i)
	{
		tri[i] = query(i + 1, i + 3);
		if (tri[i] == kiek[i] + kiek[i + 1]) {
			if (inc) {
				// ats[i + 1] = ats[i] + kiek[i];
				ats[i + 2] = ats[i + 1] + kiek[i + 1];
			} else {
				// ats[i + 1] = ats[i] - kiek[i];
				ats[i + 2] = ats[i + 1] - kiek[i + 1];
			}
		} else {
			if (inc) {
				// ats[i + 1] = ats[i] + kiek[i];
				ats[i + 2] = ats[i + 1] - kiek[i + 1];
			} else {
				// ats[i + 1] = ats[i] - kiek[i];
				ats[i + 2] = ats[i + 1] + kiek[i + 1];
			}
			inc = !inc;
		}
	}

	int diff = 1 - *min_element(ats.begin(), ats.end());
	for (auto &u : ats)
		u += diff;

	int maz = int(min_element(ats.begin(), ats.end()) - ats.begin());
	int did = int(max_element(ats.begin(), ats.end()) - ats.begin());

	if (did < maz)
	{
		for (auto &u : ats)
			u = N - u + 1;
	}

	for (int i = 0; i < N; ++i)
		answer(i + 1, ats[i]);
	// print(ats);
}


/* Look for:
* special cases (n=1?)
* overflow (ll vs int?)
* the exact constraints (multiple sets are too slow for n=10^6 :( )
* array bounds
*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 6 ms 248 KB Output is correct
4 Correct 7 ms 376 KB Output is correct
5 Correct 6 ms 380 KB Output is correct
6 Correct 7 ms 248 KB Output is correct
7 Correct 7 ms 248 KB Output is correct
8 Correct 7 ms 248 KB Output is correct
9 Correct 7 ms 248 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 7 ms 248 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 6 ms 248 KB Output is correct
14 Correct 7 ms 248 KB Output is correct
15 Correct 7 ms 248 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 6 ms 248 KB Output is correct
4 Correct 7 ms 376 KB Output is correct
5 Correct 6 ms 380 KB Output is correct
6 Correct 7 ms 248 KB Output is correct
7 Correct 7 ms 248 KB Output is correct
8 Correct 7 ms 248 KB Output is correct
9 Correct 7 ms 248 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 7 ms 248 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 6 ms 248 KB Output is correct
14 Correct 7 ms 248 KB Output is correct
15 Correct 7 ms 248 KB Output is correct
16 Correct 8 ms 320 KB Output is correct
17 Correct 14 ms 248 KB Output is correct
18 Correct 20 ms 248 KB Output is correct
19 Correct 22 ms 248 KB Output is correct
20 Correct 21 ms 376 KB Output is correct
21 Correct 22 ms 248 KB Output is correct
22 Correct 23 ms 248 KB Output is correct
23 Correct 23 ms 248 KB Output is correct
24 Correct 21 ms 376 KB Output is correct
25 Correct 23 ms 248 KB Output is correct
26 Correct 27 ms 300 KB Output is correct
27 Correct 24 ms 248 KB Output is correct
28 Correct 14 ms 324 KB Output is correct
29 Correct 24 ms 376 KB Output is correct
30 Correct 24 ms 248 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 6 ms 248 KB Output is correct
4 Correct 7 ms 376 KB Output is correct
5 Correct 6 ms 380 KB Output is correct
6 Correct 7 ms 248 KB Output is correct
7 Correct 7 ms 248 KB Output is correct
8 Correct 7 ms 248 KB Output is correct
9 Correct 7 ms 248 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 7 ms 248 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 6 ms 248 KB Output is correct
14 Correct 7 ms 248 KB Output is correct
15 Correct 7 ms 248 KB Output is correct
16 Correct 8 ms 320 KB Output is correct
17 Correct 14 ms 248 KB Output is correct
18 Correct 20 ms 248 KB Output is correct
19 Correct 22 ms 248 KB Output is correct
20 Correct 21 ms 376 KB Output is correct
21 Correct 22 ms 248 KB Output is correct
22 Correct 23 ms 248 KB Output is correct
23 Correct 23 ms 248 KB Output is correct
24 Correct 21 ms 376 KB Output is correct
25 Correct 23 ms 248 KB Output is correct
26 Correct 27 ms 300 KB Output is correct
27 Correct 24 ms 248 KB Output is correct
28 Correct 14 ms 324 KB Output is correct
29 Correct 24 ms 376 KB Output is correct
30 Correct 24 ms 248 KB Output is correct
31 Correct 43 ms 376 KB Output is correct
32 Correct 36 ms 328 KB Output is correct
33 Correct 75 ms 376 KB Output is correct
34 Correct 86 ms 340 KB Output is correct
35 Correct 90 ms 376 KB Output is correct
36 Correct 95 ms 376 KB Output is correct
37 Correct 86 ms 376 KB Output is correct
38 Correct 91 ms 376 KB Output is correct
39 Correct 92 ms 376 KB Output is correct
40 Correct 70 ms 380 KB Output is correct
41 Correct 96 ms 376 KB Output is correct
42 Correct 91 ms 416 KB Output is correct
43 Correct 97 ms 376 KB Output is correct
44 Correct 94 ms 440 KB Output is correct
45 Correct 94 ms 376 KB Output is correct
46 Correct 90 ms 376 KB Output is correct
47 Correct 82 ms 376 KB Output is correct
48 Correct 88 ms 380 KB Output is correct
49 Correct 92 ms 376 KB Output is correct
50 Correct 98 ms 456 KB Output is correct
51 Correct 77 ms 376 KB Output is correct
52 Correct 74 ms 344 KB Output is correct
53 Correct 92 ms 376 KB Output is correct
54 Correct 93 ms 376 KB Output is correct
55 Correct 88 ms 376 KB Output is correct
56 Correct 97 ms 376 KB Output is correct
57 Correct 90 ms 376 KB Output is correct
58 Correct 88 ms 376 KB Output is correct
59 Correct 125 ms 376 KB Output is correct
60 Correct 96 ms 428 KB Output is correct