oj.uz

답안 #578497

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
578497 2022-06-17T04:54:37 Z amunduzbaev The Potion of Great Power (CEOI20_potion) C++17
56 / 100
 3000 ms 206092 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 = 20;
vector<ar<int, 2>> edges[N];
vector<multiset<int>> vals[N];
vector<int> tim[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[]) {
	set<ar<int, 2>> ss;
	for(int i=0;i<U;i++){
		if(A[i] > B[i]) swap(A[i], B[i]);
		int t = 1;
		if(ss.count({A[i], B[i]})) t = -1;
		edges[A[i]].push_back({i + 1, (B[i] + 1) * t});
		edges[B[i]].push_back({i + 1, (A[i] + 1) * t});
		if(t == 1) ss.insert({A[i], B[i]});
		else ss.erase({A[i], B[i]});
	}
	
	for(int i=0;i<n;i++){
		multiset<int> ss;
		for(int j=0;j<(int)edges[i].size();j++){
			if(j % C == 0){
				vals[i].push_back(ss);
				tim[i].push_back(edges[i][j][0]);
			}
			
			if(edges[i][j][1] < 0){
				ss.erase(ss.lower_bound(h[-edges[i][j][1] - 1]));
			} else {
				ss.insert(h[edges[i][j][1] - 1]);
			}
		}
	}
}
 
multiset<int> get(int a, int t){
	int j = upper_bound(tim[a].begin(), tim[a].end(), t) - tim[a].begin();
	if(!j){
		return {};
	} j--;
	
	multiset<int> res = vals[a][j];
	for(int k=j*C;k<(int)edges[a].size() && edges[a][k][0]<=t;k++){
		assert(k < (j + 1) * C);
		if(edges[a][k][1] > 0){
			res.insert(h[edges[a][k][1] - 1]);
		} else {
			res.erase(res.lower_bound(h[-edges[a][k][1] - 1]));
		}
	}
	
	return res;
}
 
int question(int x, int y, int v) {
	multiset<int> a = get(x, v);
	multiset<int> b = get(y, v);
	
	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 - last);
		if(f == 1 && lx != a.end()) res = min(res, *lx - last);
		if(lx != a.end() && rx != b.end()){
			if(*lx <= *rx) last = *lx, f = 0, lx++;
			else last = *rx, 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 6 ms 7296 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 7504 KB Output is correct
2 Correct 8 ms 7540 KB Output is correct
3 Correct 8 ms 7552 KB Output is correct
4 Correct 21 ms 8392 KB Output is correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 465 ms 34008 KB Output is correct
2 Correct 505 ms 33920 KB Output is correct
3 Correct 377 ms 23168 KB Output is correct
4 Correct 2084 ms 136780 KB Output is correct
5 Correct 758 ms 43024 KB Output is correct
6 Execution timed out 3080 ms 194272 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 421 ms 33964 KB Output is correct
2 Correct 2165 ms 206092 KB Output is correct
3 Correct 1358 ms 109960 KB Output is correct
4 Correct 2307 ms 193228 KB Output is correct
5 Correct 504 ms 43660 KB Output is correct
6 Correct 2626 ms 193764 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 9032 KB Output is correct
2 Correct 121 ms 8144 KB Output is correct
3 Correct 201 ms 8168 KB Output is correct
4 Correct 911 ms 11792 KB Output is correct
5 Correct 893 ms 11204 KB Output is correct
6 Correct 158 ms 8520 KB Output is correct
7 Correct 929 ms 10440 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 7296 KB Output is correct
2 Correct 6 ms 7504 KB Output is correct
3 Correct 8 ms 7540 KB Output is correct
4 Correct 8 ms 7552 KB Output is correct
5 Correct 21 ms 8392 KB Output is correct
6 Correct 465 ms 34008 KB Output is correct
7 Correct 505 ms 33920 KB Output is correct
8 Correct 377 ms 23168 KB Output is correct
9 Correct 2084 ms 136780 KB Output is correct
10 Correct 758 ms 43024 KB Output is correct
11 Execution timed out 3080 ms 194272 KB Time limit exceeded
12 Halted 0 ms 0 KB -