Submission #917183

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
917183	2024-01-27T11:39:04 Z	GrindMachine	Xylophone (JOI18_xylophone)	C++17	100 / 100	68 ms	2440 KB

xylophone

#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);
	};

	vector<int> d(n+5);
	d[1] = f(1,2);
	int sign = 1;

	for(int i = 2; i < n; ++i){
		d[i] = sign*f(i,i+1);
		if(abs(d[i-1])+abs(d[i]) != f(i-1,i+1)){
			sign *= -1;
			d[i] *= -1;
		}
	}

	sign = 1;

	rep1(iter,2){
		if(iter == 2){
			sign = -1;
		}

		rep1(i,n-1) d[i] *= sign;

		int mn_pref = inf1;
		int pref = 0;
		rep1(i,n){
			pref += d[i-1];
			amin(mn_pref,pref);
		}

		vector<int> a(n+5);
		a[1] = -mn_pref+1;
		for(int i = 2; i <= n; ++i){
			a[i] = a[i-1]+d[i-1];
		}

		bool ok = true;
		int pos1 = -1, posn = -1;

		rep1(i,n){
			if(a[i] < 1 or a[i] > n){
				ok = false;
				break;
			}

			if(a[i] == 1) pos1 = i;
			else if(a[i] == n) posn = i;
		}

		if(pos1 > posn) ok = false;
		if(!ok) conts;

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

		return;
	}

	assert(0);
}

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	428 KB	Output is correct
4	Correct	1 ms	688 KB	Output is correct
5	Correct	1 ms	432 KB	Output is correct
6	Correct	1 ms	432 KB	Output is correct
7	Correct	1 ms	440 KB	Output is correct
8	Correct	1 ms	692 KB	Output is correct
9	Correct	1 ms	688 KB	Output is correct
10	Correct	1 ms	436 KB	Output is correct
11	Correct	2 ms	344 KB	Output is correct
12	Correct	1 ms	436 KB	Output is correct
13	Correct	1 ms	696 KB	Output is correct
14	Correct	1 ms	432 KB	Output is correct
15	Correct	1 ms	436 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	428 KB	Output is correct
4	Correct	1 ms	688 KB	Output is correct
5	Correct	1 ms	432 KB	Output is correct
6	Correct	1 ms	432 KB	Output is correct
7	Correct	1 ms	440 KB	Output is correct
8	Correct	1 ms	692 KB	Output is correct
9	Correct	1 ms	688 KB	Output is correct
10	Correct	1 ms	436 KB	Output is correct
11	Correct	2 ms	344 KB	Output is correct
12	Correct	1 ms	436 KB	Output is correct
13	Correct	1 ms	696 KB	Output is correct
14	Correct	1 ms	432 KB	Output is correct
15	Correct	1 ms	436 KB	Output is correct
16	Correct	3 ms	684 KB	Output is correct
17	Correct	5 ms	728 KB	Output is correct
18	Correct	10 ms	992 KB	Output is correct
19	Correct	8 ms	1252 KB	Output is correct
20	Correct	8 ms	1468 KB	Output is correct
21	Correct	8 ms	1204 KB	Output is correct
22	Correct	11 ms	952 KB	Output is correct
23	Correct	10 ms	1476 KB	Output is correct
24	Correct	8 ms	1464 KB	Output is correct
25	Correct	9 ms	696 KB	Output is correct
26	Correct	9 ms	1236 KB	Output is correct
27	Correct	9 ms	1512 KB	Output is correct
28	Correct	9 ms	1476 KB	Output is correct
29	Correct	8 ms	1212 KB	Output is correct
30	Correct	10 ms	696 KB	Output is correct

Subtask #3
53.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	428 KB	Output is correct
4	Correct	1 ms	688 KB	Output is correct
5	Correct	1 ms	432 KB	Output is correct
6	Correct	1 ms	432 KB	Output is correct
7	Correct	1 ms	440 KB	Output is correct
8	Correct	1 ms	692 KB	Output is correct
9	Correct	1 ms	688 KB	Output is correct
10	Correct	1 ms	436 KB	Output is correct
11	Correct	2 ms	344 KB	Output is correct
12	Correct	1 ms	436 KB	Output is correct
13	Correct	1 ms	696 KB	Output is correct
14	Correct	1 ms	432 KB	Output is correct
15	Correct	1 ms	436 KB	Output is correct
16	Correct	3 ms	684 KB	Output is correct
17	Correct	5 ms	728 KB	Output is correct
18	Correct	10 ms	992 KB	Output is correct
19	Correct	8 ms	1252 KB	Output is correct
20	Correct	8 ms	1468 KB	Output is correct
21	Correct	8 ms	1204 KB	Output is correct
22	Correct	11 ms	952 KB	Output is correct
23	Correct	10 ms	1476 KB	Output is correct
24	Correct	8 ms	1464 KB	Output is correct
25	Correct	9 ms	696 KB	Output is correct
26	Correct	9 ms	1236 KB	Output is correct
27	Correct	9 ms	1512 KB	Output is correct
28	Correct	9 ms	1476 KB	Output is correct
29	Correct	8 ms	1212 KB	Output is correct
30	Correct	10 ms	696 KB	Output is correct
31	Correct	24 ms	1492 KB	Output is correct
32	Correct	28 ms	1524 KB	Output is correct
33	Correct	40 ms	1896 KB	Output is correct
34	Correct	59 ms	1896 KB	Output is correct
35	Correct	49 ms	1280 KB	Output is correct
36	Correct	41 ms	1220 KB	Output is correct
37	Correct	55 ms	1820 KB	Output is correct
38	Correct	59 ms	1132 KB	Output is correct
39	Correct	52 ms	2092 KB	Output is correct
40	Correct	47 ms	1640 KB	Output is correct
41	Correct	49 ms	1692 KB	Output is correct
42	Correct	54 ms	1488 KB	Output is correct
43	Correct	58 ms	2100 KB	Output is correct
44	Correct	46 ms	2352 KB	Output is correct
45	Correct	49 ms	1228 KB	Output is correct
46	Correct	51 ms	2264 KB	Output is correct
47	Correct	50 ms	1796 KB	Output is correct
48	Correct	54 ms	1768 KB	Output is correct
49	Correct	44 ms	2352 KB	Output is correct
50	Correct	44 ms	2224 KB	Output is correct
51	Correct	48 ms	1588 KB	Output is correct
52	Correct	52 ms	1864 KB	Output is correct
53	Correct	68 ms	2440 KB	Output is correct
54	Correct	47 ms	1476 KB	Output is correct
55	Correct	58 ms	2088 KB	Output is correct
56	Correct	52 ms	1436 KB	Output is correct
57	Correct	39 ms	976 KB	Output is correct
58	Correct	43 ms	1572 KB	Output is correct
59	Correct	50 ms	2032 KB	Output is correct
60	Correct	52 ms	1240 KB	Output is correct

Submission #917183

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 36.0 / 36.0

Subtask #3 53.0 / 53.0

Subtask #1
11.0 / 11.0

Subtask #2
36.0 / 36.0

Subtask #3
53.0 / 53.0