oj.uz

답안 #964488

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
964488 2024-04-17T01:39:14 Z pcc The Potion of Great Power (CEOI20_potion) C++17
70 / 100
 3000 ms 151248 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,popcnt,sse4")
#define pii pair<int,int>
#define fs first
#define sc second
#define ll long long

const int mxn = 2e5+10;

int nid[mxn*100],val[mxn*100];
int vcnt = 0;

struct node{
	int head;
	int pl,pr;
};

int add(int now,int v){
	vcnt++;
	nid[vcnt] = now;
	val[vcnt] = v;
	return vcnt;
}

struct SEG{
#define mid ((l+r)>>1)
#define ls seg[now].pl
#define rs seg[now].pr
	node seg[mxn*50];
	int ppp = 0;
	SEG(){}
	int newnode(){
		return ++ppp;
	}
	int modify(int now,int l,int r,int s,int e,int v){
		if(!now)now = newnode();
		if(l>=s&&e>=r){
			seg[now].head = add(seg[now].head,v);
			return now;
		}
		if(mid>=s)ls = modify(ls,l,mid,s,e,v);
		if(mid<e)rs = modify(rs,mid+1,r,s,e,v);
		return now;
	}
	vector<int> re;
	void getval(int now,int l,int r,int p){
		if(!now)return;
		for(int i = seg[now].head;i;i = nid[i])re.push_back(val[i]);
		if(l == r)return;
		if(mid>=p)getval(ls,l,mid,p);
		else getval(rs,mid+1,r,p);
		return;
	}
#undef ls
#undef rs
#undef mid
};

SEG seg;
int arr[mxn],N,D;
int rt[mxn];

void init(int NN, int DD, int H[]) {
	N = NN,D = DD;
	for(int i = 0;i<N;i++){
		arr[i] = H[i];
	}
	return;
}

void curseChanges(int U, int A[], int B[]) {
	map<ll,int> mp;
	for(int i = 0;i<U;i++){
		pii p = {A[i],B[i]};
		if(p.fs>p.sc)swap(p.fs,p.sc);
		ll h = 1ll*p.fs*mxn+p.sc;
		if(mp.find(h) != mp.end()){
			rt[p.fs] = seg.modify(rt[p.fs],0,mxn-10,mp[h]+1,i,arr[p.sc]);
			rt[p.sc] = seg.modify(rt[p.sc],0,mxn-10,mp[h]+1,i,arr[p.fs]);
			mp.erase(h);
		}
		else{
			mp[h] = i;
		}
	}
	for(auto &i:mp){
		pii p = pii(i.fs/mxn,i.fs%mxn);
		rt[p.fs] = seg.modify(rt[p.fs],0,mxn-10,i.sc+1,mxn-1,arr[p.sc]);
		rt[p.sc] = seg.modify(rt[p.sc],0,mxn-10,i.sc+1,mxn-1,arr[p.fs]);
	}
	return;
}

int question(int x, int y, int v) {
	seg.re.clear();seg.getval(rt[x],0,mxn-10,v);
	auto ta = seg.re;
	seg.re.clear();seg.getval(rt[y],0,mxn-10,v);
	auto tb = seg.re;
	assert(ta.size()<=500);
	assert(tb.size()<=500);
	sort(ta.begin(),ta.end());
	sort(tb.begin(),tb.end());
	int pt = 0;
	int ans = 1e9;
	for(auto &i:ta){
		while(pt != tb.size()&&tb[pt]<i)pt++;
		if(pt != tb.size())ans = min(ans,abs(i-tb[pt]));
		if(pt-1>=0)ans = min(ans,abs(i-tb[pt-1]));
	}
	return ans;
}

Compilation message

potion.cpp: In function 'int question(int, int, int)':
potion.cpp:109:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |   while(pt != tb.size()&&tb[pt]<i)pt++;
      |         ~~~^~~~~~~~~~~~
potion.cpp:110:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |   if(pt != tb.size())ans = min(ans,abs(i-tb[pt]));
      |      ~~~^~~~~~~~~~~~

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6488 KB Output is correct
2 Correct 3 ms 6488 KB Output is correct
3 Correct 4 ms 6488 KB Output is correct
4 Correct 13 ms 7684 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 435 ms 151132 KB Output is correct
2 Correct 419 ms 151248 KB Output is correct
3 Correct 209 ms 57936 KB Output is correct
4 Correct 1747 ms 98836 KB Output is correct
5 Correct 792 ms 128160 KB Output is correct
6 Correct 2496 ms 113044 KB Output is correct
7 Correct 604 ms 123996 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 406 ms 151156 KB Output is correct
2 Correct 1395 ms 77668 KB Output is correct
3 Correct 1443 ms 116292 KB Output is correct
4 Correct 2420 ms 113192 KB Output is correct
5 Correct 496 ms 149116 KB Output is correct
6 Correct 2282 ms 113180 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 13552 KB Output is correct
2 Correct 69 ms 10548 KB Output is correct
3 Correct 82 ms 9716 KB Output is correct
4 Correct 609 ms 11840 KB Output is correct
5 Correct 593 ms 12884 KB Output is correct
6 Correct 83 ms 11608 KB Output is correct
7 Correct 474 ms 10328 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 3 ms 6488 KB Output is correct
3 Correct 3 ms 6488 KB Output is correct
4 Correct 4 ms 6488 KB Output is correct
5 Correct 13 ms 7684 KB Output is correct
6 Correct 435 ms 151132 KB Output is correct
7 Correct 419 ms 151248 KB Output is correct
8 Correct 209 ms 57936 KB Output is correct
9 Correct 1747 ms 98836 KB Output is correct
10 Correct 792 ms 128160 KB Output is correct
11 Correct 2496 ms 113044 KB Output is correct
12 Correct 604 ms 123996 KB Output is correct
13 Correct 406 ms 151156 KB Output is correct
14 Correct 1395 ms 77668 KB Output is correct
15 Correct 1443 ms 116292 KB Output is correct
16 Correct 2420 ms 113192 KB Output is correct
17 Correct 496 ms 149116 KB Output is correct
18 Correct 2282 ms 113180 KB Output is correct
19 Correct 46 ms 13552 KB Output is correct
20 Correct 69 ms 10548 KB Output is correct
21 Correct 82 ms 9716 KB Output is correct
22 Correct 609 ms 11840 KB Output is correct
23 Correct 593 ms 12884 KB Output is correct
24 Correct 83 ms 11608 KB Output is correct
25 Correct 474 ms 10328 KB Output is correct
26 Correct 778 ms 67712 KB Output is correct
27 Correct 1760 ms 116372 KB Output is correct
28 Correct 1737 ms 135332 KB Output is correct
29 Correct 1888 ms 98908 KB Output is correct
30 Execution timed out 3029 ms 113024 KB Time limit exceeded
31 Halted 0 ms 0 KB -