oj.uz

답안 #1046120

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1046120 2024-08-06T10:17:24 Z Minbaev Xylophone (JOI18_xylophone) C++17
100 / 100
 40 ms 1428 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
#include <ext/pb_ds/assoc_container.hpp> 
 
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
 
using namespace std;
using namespace __gnu_pbds;
 
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f first
#define s second
//~ #define int long long
#define ll long long
#define pii pair<int,int>
#define ar array
 
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
 
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
 tree_order_statistics_node_update> ordered_set;
 
const int inf = 1e17 + 7;
const int mod = 1e9 + 7;
const int N = 3e5 + 5;
const int md = 998244353;
 
int binpow(int a, int b){
	if(b == 0)return 1;
	if(b % 2 == 0){
		int c = binpow(a,b/2);
		return (c*c)%mod;
	}
	return (binpow(a,b-1)*a)%mod;
}
 
int divi(int a, int b){
	return (a*(binpow(b,mod-2)))%mod;
}
 
int n,m,k;
 
void solve(int n){
	
	map<int,int>v;
	//~ for(int i = 1;i<n;i++){
		//~ v[i] = quer
	//~ }
	
	int l = 2, r = n, pos = n;
	while(l <= r){
		int mid = (l+r) / 2;
		int h = query(1,mid);
		//~ cout << 1 << " " << mid << endl;
		//~ int h;
		//~ cin >> h;	
		if(h == n-1){ 
			pos = mid;
			r = mid - 1;
		}
		else l = mid + 1;
	}
	
	//~ cout << pos << "\n";
	
	map<int,int> vis, ans;
	
	ans[pos] = n;
	vis[n] = 1;
	
	int h, u;
	
	h = query(pos - 1, pos);
	//~ cout << pos - 1 << " " << pos << endl;
	//~ cin >> h;
	ans[pos - 1] = n - h;
	vis[n - h] = 1;
	v[pos - 1] = h;
	
	if(pos < n){
		h = query(pos, pos + 1);
		//~ cout << pos << " " << pos + 1 << endl;
		//~ cin >> h;
		ans[pos + 1] = n - h;
		vis[n - h] = 1;
		v[pos] = h;
	}
	
	bool flag = true;
	
	for(l = pos - 2; l>=1; l--){
		h = query(l, l+1);
		//~ cout << l << " " << l + 1 << endl;
		//~ cin >> h;
		v[l] = h;
		
		if(vis[ans[l+1]+h] == 1 || ans[l+1] + h > n){
			ans[l] = ans[l+1] - h;
			vis[ans[l+1] - h] = 1;
			flag = true;
			continue;
		}
		
		if(vis[ans[l+1]-h] == 1 || ans[l+1] - h < 1){
			ans[l] = ans[l+1] + h;
			vis[ans[l+1] + h] = 1;
			flag = false;
			continue;
		}
		
		if(flag){
			u = query(l, l + 2);
			//~ cout << l << " " << l + 2 << endl;
			//~ cin	>> u;
			
			if(u == v[l+1] || u == h){
				ans[l] = ans[l+1] + h;
				vis[ans[l+1] + h] = 1;
				flag = false;
			}
			else{
				ans[l] = ans[l+1] - h;
				vis[ans[l+1] - h] = 1;
				flag = true;
			}
		}
		
		else if(!flag){
			u = query(l, l + 2);
			//~ cout << l << " " << l + 2 << endl;
			//~ cin >> u;
			
			if(u == v[l+1] || u == h){
				ans[l] = ans[l+1] - h;
				vis[ans[l+1] - h] = 1;
				flag = true;
			}
			else{
				ans[l] = ans[l+1] + h;
				vis[ans[l+1] + h] = 1;
				flag = false;
			}
		}
	}
	
	//-------------------------------------------------------------------------
	flag = true;
	
	for(l = pos + 2; l <= n; l++){
		h = query(l-1, l);
		//~ cout << l - 1 << " " << l << endl;
		//~ cin >> h;
		v[l-1] = h;
		
		if(vis[ans[l-1]+h] == 1 || ans[l-1] + h > n){
			ans[l] = ans[l-1] - h;
			vis[ans[l-1] - h] = 1;
			flag = true;
			continue;
		}
		
		if(vis[ans[l-1]-h] == 1 || ans[l-1] - h < 1){
			ans[l] = ans[l-1] + h;
			vis[ans[l-1] + h] = 1;
			flag = false;
			continue;
		}
		
		if(flag){
			u = query(l-2, l);
			//~ cout << l - 2<< " " << l << endl;
			//~ cin	>> u;
			
			if(u == h || u == v[l-2]){
				ans[l] = ans[l-1] + h;
				vis[ans[l-1] + h] = 1;
				flag = false;
			}
			else{
				ans[l] = ans[l-1] - h;
				vis[ans[l-1] - h] = 1;
				flag = true;
			}
		}
		
		else if(!flag){
			u = query(l-2, l);
			//~ cout << l - 2 << " " << l << endl;
			//~ cin >> u;
			
			if(u == h || u == v[l-2]){
				ans[l] = ans[l-1] - h;
				vis[ans[l-1] - h] = 1;
				flag = true;
			}
			else{
				ans[l] = ans[l-1] + h;
				vis[ans[l-1] + h] = 1;
				flag = false;
			}
		}
	}
	
	for(int i = 1;i<=n;i++)answer(i, ans[i]);
	return;
}
/*
 
*/
 //~ signed main()
//~ {
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	//~ ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	//~ int tt=1;//cin>>tt;
	//~ while(tt--)solve(5);
 
//~ }

Compilation message

xylophone.cpp:27:22: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+17' to '2147483647' [-Woverflow]
   27 | const int inf = 1e17 + 7;
      |                 ~~~~~^~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 6 ms 576 KB Output is correct
22 Correct 6 ms 344 KB Output is correct
23 Correct 4 ms 600 KB Output is correct
24 Correct 5 ms 600 KB Output is correct
25 Correct 5 ms 600 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Correct 6 ms 648 KB Output is correct
28 Correct 6 ms 532 KB Output is correct
29 Correct 5 ms 520 KB Output is correct
30 Correct 8 ms 460 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 6 ms 576 KB Output is correct
22 Correct 6 ms 344 KB Output is correct
23 Correct 4 ms 600 KB Output is correct
24 Correct 5 ms 600 KB Output is correct
25 Correct 5 ms 600 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Correct 6 ms 648 KB Output is correct
28 Correct 6 ms 532 KB Output is correct
29 Correct 5 ms 520 KB Output is correct
30 Correct 8 ms 460 KB Output is correct
31 Correct 13 ms 680 KB Output is correct
32 Correct 17 ms 768 KB Output is correct
33 Correct 26 ms 1228 KB Output is correct
34 Correct 29 ms 1104 KB Output is correct
35 Correct 33 ms 1364 KB Output is correct
36 Correct 21 ms 912 KB Output is correct
37 Correct 25 ms 1376 KB Output is correct
38 Correct 35 ms 1364 KB Output is correct
39 Correct 30 ms 1104 KB Output is correct
40 Correct 36 ms 1428 KB Output is correct
41 Correct 39 ms 1360 KB Output is correct
42 Correct 19 ms 1104 KB Output is correct
43 Correct 31 ms 1376 KB Output is correct
44 Correct 23 ms 1264 KB Output is correct
45 Correct 29 ms 980 KB Output is correct
46 Correct 39 ms 1420 KB Output is correct
47 Correct 37 ms 1096 KB Output is correct
48 Correct 33 ms 1220 KB Output is correct
49 Correct 35 ms 1356 KB Output is correct
50 Correct 37 ms 1188 KB Output is correct
51 Correct 33 ms 1176 KB Output is correct
52 Correct 28 ms 1288 KB Output is correct
53 Correct 29 ms 1104 KB Output is correct
54 Correct 40 ms 1360 KB Output is correct
55 Correct 36 ms 1208 KB Output is correct
56 Correct 34 ms 1012 KB Output is correct
57 Correct 34 ms 1196 KB Output is correct
58 Correct 32 ms 1104 KB Output is correct
59 Correct 39 ms 1128 KB Output is correct
60 Correct 30 ms 1104 KB Output is correct