답안 #769002

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
769002	2023-06-29T04:35:07 Z	boyliguanhan	The Potion of Great Power (CEOI20_potion)	C++17	0 / 100	3000 ms	31456 KB

potion

#include<bits/stdc++.h>
#pragma GCC optimize(2)
#define NN 100100
using namespace std;
int h[NN], n;
unordered_set<int> adj[NN];
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 = 1; i <= U; i++) {
        int a= A[i-1], b = B[i-1];
        if(adj[a].count(b)) adj[a].erase(b), adj[b].erase(a);
        else adj[a].insert(b), adj[b].insert(a);
    }
}
int calc(vector<int> a, vector<int> b){
    int ans = 1e9;
    for(int i = 0, j = 0; i < (int)a.size()&&j < (int)b.size();i++) {
        if(a[i]>b[j]) swap(a, b), swap(i, j);
        if(j) ans=min(ans,(int)abs(a[i]-b[j-1]));
        ans = min(ans, abs(a[i] - b[j]));
    }
    return ans;
}
int question(int x, int y, int v) {
    unordered_set<int> a = adj[x], b = adj[y];
    vector<int> c, d;
    for(auto i: a) c.push_back(h[i]);
    for(auto i: b) d.push_back(h[i]);
    sort(c.begin(), c.end());
    sort(d.begin(), d.end());
    return calc(c,d);
}

Subtask #1
0 / 0.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	3 ms	5712 KB	Incorrect
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	4 ms	5968 KB	Incorrect
2	Halted	0 ms	0 KB	-

Subtask #3
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	255 ms	31456 KB	Output is correct
2	Correct	272 ms	31416 KB	Output is correct
3	Correct	115 ms	8260 KB	Output is correct
4	Correct	1867 ms	15592 KB	Output is correct
5	Correct	547 ms	24760 KB	Output is correct
6	Execution timed out	3024 ms	21668 KB	Time limit exceeded
7	Halted	0 ms	0 KB	-