제출 #1159720

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1159720		thelegendary08	Specijacija (COCI20_specijacija)	C++17	20 / 110	4091 ms	2036 KiB

Main

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
const int mxn = 2e5 + 5;
int layer(int x){
	int lo = 1;
	int hi = mxn;
	while(lo < hi){
		int mid = (lo + hi)/2;
		if(mid * (mid - 1) / 2 < x && mid * (mid + 1) / 2 >= x)return mid;
		else if(mid * (mid - 1) / 2 >= x)hi = mid - 1;
		else lo = mid + 1;
	}
	return lo;
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in3(n,q,t);
	vin(v,n);
	f0r(i,n){
		v[i] -= 1 + i * (i+1) / 2;
	}
	//vout(v);
	while(q--){
		in2(a,b);
		int la, lb;
		la = layer(a);
		lb = layer(b);
		
		if(la < lb){
			swap(a,b);
			swap(la,lb);
		}
		int posa = a - la * (la - 1) / 2 - 1;
		int posb = b - lb * (lb - 1) / 2 - 1;
		int thing = la - lb;
		// dout2(a,b);
		// dout2(la,lb);
		// dout2(posa, posb);
		
		f0r(i, thing){
			if(v[la-2] < posa){
				posa--;
				la--;
			}
			else la--;
		}
		//dout(posa);
		
		while(posa != posb){
			if(v[la-2] < posa){
				posa--;
			}
			if(v[la - 2] < posb){
				posb--;
			}
			la--;
		}
		out(la * (la - 1) / 2 + posa + 1);
		
	}
	
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 30
• Subtask 4: 0 / 60