oj.uz

Submission #578485

# Submission time Handle Problem Language Result Execution time Memory
578485 2022-06-17T04:46:37 Z amunduzbaev The Potion of Great Power (CEOI20_potion) C++17
56 / 100
 3000 ms 89468 KB 
#include "bits/stdc++.h"
using namespace std;
#ifndef EVAL
#include "grader.cpp"
#endif
 
#define ar array
#define ff first
#define ss second
const int N = 1e5 + 5;
const int C = 50;
vector<pair<int, int>> edges[N];
vector<set<pair<int, int>>> 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<pair<int, int>> ss;
		int v = 0;
		for(int j=0;j<(int)edges[i].size();j++){
			if(j == v){ v += C;
				vals[i].push_back(ss);
			}
			int x = edges[i][j].ss;
			if(ss.count({h[x], x})){
				ss.erase({h[x], x});
			} else {
				ss.insert({h[x], x});
			}
		}
	}
}

void get(int a, int t, set<pair<int, int>>& res){
	int j = lower_bound(edges[a].begin(), edges[a].end(), make_pair(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].ff<=t;k++){
		int x = edges[a][k].ss;
		if(res.count({h[x], x})){
			res.erase({h[x], x});
		} else {
			res.insert({h[x], x});
		}
	}
	
	return;
}

set<pair<int, int>> 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).ff - last);
		if(f == 1 && lx != a.end()) res = min(res, (*lx).ff - last);
		if(lx != a.end() && rx != b.end()){
			if(*lx <= *rx) last = (*lx).ff, f = 0, lx++;
			else last = (*rx).ff, 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

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5008 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5072 KB Output is correct
2 Correct 5 ms 5020 KB Output is correct
3 Correct 4 ms 5072 KB Output is correct
4 Correct 15 ms 5872 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 19476 KB Output is correct
2 Correct 191 ms 19496 KB Output is correct
3 Correct 379 ms 14776 KB Output is correct
4 Correct 1740 ms 57864 KB Output is correct
5 Correct 639 ms 13592 KB Output is correct
6 Execution timed out 3006 ms 85620 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 215 ms 19468 KB Output is correct
2 Correct 2477 ms 89468 KB Output is correct
3 Correct 1533 ms 51812 KB Output is correct
4 Correct 2540 ms 85112 KB Output is correct
5 Correct 362 ms 23320 KB Output is correct
6 Correct 2844 ms 85232 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 5968 KB Output is correct
2 Correct 210 ms 5440 KB Output is correct
3 Correct 369 ms 5584 KB Output is correct
4 Correct 1032 ms 7164 KB Output is correct
5 Correct 965 ms 6864 KB Output is correct
6 Correct 180 ms 5328 KB Output is correct
7 Correct 951 ms 6448 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5008 KB Output is correct
2 Correct 4 ms 5072 KB Output is correct
3 Correct 5 ms 5020 KB Output is correct
4 Correct 4 ms 5072 KB Output is correct
5 Correct 15 ms 5872 KB Output is correct
6 Correct 198 ms 19476 KB Output is correct
7 Correct 191 ms 19496 KB Output is correct
8 Correct 379 ms 14776 KB Output is correct
9 Correct 1740 ms 57864 KB Output is correct
10 Correct 639 ms 13592 KB Output is correct
11 Execution timed out 3006 ms 85620 KB Time limit exceeded
12 Halted 0 ms 0 KB -