oj.uz

Submission #917172

# Submission time Handle Problem Language Result Execution time Memory
917172 2024-01-27T11:18:22 Z GrindMachine Xylophone (JOI18_xylophone) C++17
47 / 100
 51 ms 1968 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

read some solutions a long time ago, remember some key ideas from there 

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "xylophone.h"

void solve(int n) {
	map<pii,int> mp;
	auto f = [&](int l, int r){
		pii px = {l,r};
		if(mp.count(px)) return mp[px];
		return mp[px] = query(l,r);
	};

	int pos1 = -1;
	rev(i,n-1,1){
		if(query(i,n) == n-1){
			pos1 = i;
			break;
		}
	}

	vector<int> a(n+5);
	a[pos1] = 1;
	int sign = 1;

	for(int i = pos1+1; i <= n; ++i){
		int d1 = f(i-1,i);
		a[i] = a[i-1]+d1*sign;
		if(i < n){
			int d2 = f(i,i+1);
			if(d1+d2 != f(i-1,i+1)){
				sign *= -1;
			}
		}
	}

	sign = 1;

	rev(i,pos1-1,1){
		int d1 = f(i,i+1);
		a[i] = a[i+1]+d1*sign;
		if(i > 1){
			int d2 = f(i-1,i);
			if(d1+d2 != f(i-1,i+1)){
				sign *= -1;
			}
		}
	}

	rep1(i,n){
		answer(i,a[i]);
	}
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 692 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 1 ms 436 KB Output is correct
6 Correct 1 ms 688 KB Output is correct
7 Correct 1 ms 432 KB Output is correct
8 Correct 1 ms 436 KB Output is correct
9 Correct 1 ms 436 KB Output is correct
10 Correct 1 ms 432 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 1 ms 688 KB Output is correct
13 Correct 2 ms 436 KB Output is correct
14 Correct 1 ms 440 KB Output is correct
15 Correct 1 ms 432 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 692 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 1 ms 436 KB Output is correct
6 Correct 1 ms 688 KB Output is correct
7 Correct 1 ms 432 KB Output is correct
8 Correct 1 ms 436 KB Output is correct
9 Correct 1 ms 436 KB Output is correct
10 Correct 1 ms 432 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 1 ms 688 KB Output is correct
13 Correct 2 ms 436 KB Output is correct
14 Correct 1 ms 440 KB Output is correct
15 Correct 1 ms 432 KB Output is correct
16 Correct 3 ms 952 KB Output is correct
17 Correct 6 ms 712 KB Output is correct
18 Correct 11 ms 1712 KB Output is correct
19 Correct 12 ms 692 KB Output is correct
20 Correct 10 ms 1004 KB Output is correct
21 Correct 11 ms 768 KB Output is correct
22 Correct 13 ms 788 KB Output is correct
23 Correct 15 ms 1480 KB Output is correct
24 Correct 9 ms 968 KB Output is correct
25 Correct 13 ms 1488 KB Output is correct
26 Correct 10 ms 1220 KB Output is correct
27 Correct 10 ms 688 KB Output is correct
28 Correct 14 ms 1208 KB Output is correct
29 Correct 12 ms 436 KB Output is correct
30 Correct 12 ms 548 KB Output is correct

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 692 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 1 ms 436 KB Output is correct
6 Correct 1 ms 688 KB Output is correct
7 Correct 1 ms 432 KB Output is correct
8 Correct 1 ms 436 KB Output is correct
9 Correct 1 ms 436 KB Output is correct
10 Correct 1 ms 432 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 1 ms 688 KB Output is correct
13 Correct 2 ms 436 KB Output is correct
14 Correct 1 ms 440 KB Output is correct
15 Correct 1 ms 432 KB Output is correct
16 Correct 3 ms 952 KB Output is correct
17 Correct 6 ms 712 KB Output is correct
18 Correct 11 ms 1712 KB Output is correct
19 Correct 12 ms 692 KB Output is correct
20 Correct 10 ms 1004 KB Output is correct
21 Correct 11 ms 768 KB Output is correct
22 Correct 13 ms 788 KB Output is correct
23 Correct 15 ms 1480 KB Output is correct
24 Correct 9 ms 968 KB Output is correct
25 Correct 13 ms 1488 KB Output is correct
26 Correct 10 ms 1220 KB Output is correct
27 Correct 10 ms 688 KB Output is correct
28 Correct 14 ms 1208 KB Output is correct
29 Correct 12 ms 436 KB Output is correct
30 Correct 12 ms 548 KB Output is correct
31 Correct 34 ms 1320 KB Output is correct
32 Correct 37 ms 1968 KB Output is correct
33 Incorrect 51 ms 1648 KB Wrong Answer [2]
34 Halted 0 ms 0 KB -