oj.uz

답안 #578483

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
578483 2022-06-17T04:36:31 Z amunduzbaev The Potion of Great Power (CEOI20_potion) C++17
38 / 100
 3000 ms 82592 KB 
#include "bits/stdc++.h"
using namespace std;
#ifndef EVAL
#include "grader.cpp"
#endif
 
#define ar array
const int N = 1e5 + 5;
const int C = 55;
vector<ar<int, 2>> edges[N];
vector<set<ar<int, 2>>> vals[N];
int h[N], n;

void init(int N, int D, int H[]) {
	n = N;
	for(int i=0;i<N;i++){
		h[i] = H[i];
	}
}

void curseChanges(int U, int A[], int B[]) {
	for(int i=0;i<U;i++){
		edges[A[i]].push_back({i + 1, B[i]});
		edges[B[i]].push_back({i + 1, A[i]});
	}
	
	for(int i=0;i<n;i++){
		set<ar<int, 2>> ss;
		for(int j=0;j<(int)edges[i].size();j++){
			if(j % C == 0){
				vals[i].push_back(ss);
			}
			
			if(ss.count({h[edges[i][j][1]], edges[i][j][1]})){
				ss.erase({h[edges[i][j][1]], edges[i][j][1]});
			} else {
				ss.insert({h[edges[i][j][1]], edges[i][j][1]});
			}
		}
	}
}

void get(int a, int t, set<ar<int, 2>>& res){
	int j = lower_bound(edges[a].begin(), edges[a].end(), (ar<int, 2>){t + 1, -1}) - edges[a].begin();
	if(!j) return;
	j--;
	
	res = vals[a][j/C];
	for(int k=(j/C) * C;k<(int)edges[a].size() && edges[a][k][0]<=t;k++){
		if(res.count({h[edges[a][k][1]], edges[a][k][1]})){
			res.erase({h[edges[a][k][1]], edges[a][k][1]});
		} else {
			res.insert({h[edges[a][k][1]], edges[a][k][1]});
		}
	}
	
	return;
}

set<ar<int, 2>> a, b;
int question(int x, int y, int v) {
	a.clear(), b.clear();
	get(x, v, a), get(y, v, b);
	
	auto lx = a.begin(), rx = b.begin();
	int last = -1e9, f = -1, res = 1e9;
	while(lx != a.end() || rx != b.end()){
		if(f == 0 && rx != b.end()) res = min(res, (*rx)[0] - last);
		if(f == 1 && lx != a.end()) res = min(res, (*lx)[0] - last);
		if(lx != a.end() && rx != b.end()){
			if(*lx <= *rx) last = (*lx)[0], f = 0, lx++;
			else last = (*rx)[0], f = 1, rx++;
		} else break;
	}
	
	return res;
}
 
/*
 
6 5 11 4
2 42 1000 54 68 234
0 1
2 0
3 4
3 5
3 5
1 3
5 3
0 5
3 0
1 3
3 5
0 3 4 26 
3 0 8 0
0 5 5 1000000000
3 0 11 14
 
*/

Subtask #1
0.0 / 0.0

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

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5072 KB Output is correct
2 Correct 4 ms 5072 KB Output is correct
3 Correct 4 ms 5072 KB Output is correct
4 Correct 20 ms 5952 KB Output is correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 251 ms 19472 KB Output is correct
2 Correct 241 ms 19408 KB Output is correct
3 Correct 476 ms 14368 KB Output is correct
4 Correct 2000 ms 53676 KB Output is correct
5 Correct 737 ms 12384 KB Output is correct
6 Execution timed out 3094 ms 79504 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 232 ms 19484 KB Output is correct
2 Correct 2810 ms 82592 KB Output is correct
3 Correct 1752 ms 48872 KB Output is correct
4 Correct 2860 ms 79284 KB Output is correct
5 Correct 497 ms 23088 KB Output is correct
6 Execution timed out 3019 ms 79336 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 5956 KB Output is correct
2 Correct 251 ms 5456 KB Output is correct
3 Correct 467 ms 5584 KB Output is correct
4 Correct 1199 ms 7060 KB Output is correct
5 Correct 1141 ms 6872 KB Output is correct
6 Correct 225 ms 5328 KB Output is correct
7 Correct 1180 ms 6480 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 4 ms 5072 KB Output is correct
3 Correct 4 ms 5072 KB Output is correct
4 Correct 4 ms 5072 KB Output is correct
5 Correct 20 ms 5952 KB Output is correct
6 Correct 251 ms 19472 KB Output is correct
7 Correct 241 ms 19408 KB Output is correct
8 Correct 476 ms 14368 KB Output is correct
9 Correct 2000 ms 53676 KB Output is correct
10 Correct 737 ms 12384 KB Output is correct
11 Execution timed out 3094 ms 79504 KB Time limit exceeded
12 Halted 0 ms 0 KB -