oj.uz

Submission #828029

# Submission time Handle Problem Language Result Execution time Memory
828029 2023-08-17T02:05:11 Z boyliguanhan The Potion of Great Power (CEOI20_potion) C++17
38 / 100
 3000 ms 200632 KB 
#include<bits/stdc++.h>
//#include "potion.h"
#pragma GCC optimize(2)
#define NN 100100
#define C 25
using namespace std;
int h[NN], n;
map<int, int> adj[NN];
map<int, set<int>> adj2[NN];
void init(int N, int D, int H[]) {
    n = N;
    for(int i = 0; i < N; i++)
        h[i] = H[i];
}
set<int> arr[100100];
void curseChanges(int U, int A[], int B[]) {
    for(int i = 0; i < n; i++) adj[i][0], adj2[i][0];
    for(int i = 1; i <= U; i++) {
        int a = A[i-1], b = B[i-1];
        set<int> &x = arr[a], &y = arr[b];
        if(x.count(b)) x.erase(b), y.erase(a);
        else x.insert(b), y.insert(a);
        if(!(adj[a].size()%C))
            adj2[a][i] = x;
        if(!(adj[b].size()%C))
            adj2[b][i] = y;
        adj[a][i]=b;
        adj[b][i]=a;
    }
}
int calc(vector<int> a, vector<int> b){
    int ans = 1e9;
    for(int i = 0, j = 0; i < a.size() && j < b.size();i++) {
        if(a[i]>b[j]) swap(a, b), swap(i, j);
        if(j) ans=min(ans,abs(a[i]-b[j-1]));
        ans = min(ans, abs(a[i] - b[j]));
    }
    return ans;
}
int question(int x, int y, int v) {
    set<int> a, b;
    int a2, b2;
    tie(a2,a)=*--adj2[x].upper_bound(v);
    tie(b2,b)=*--adj2[y].upper_bound(v);
    auto it1 = adj[x].upper_bound(a2);
    auto it2 = adj[y].upper_bound(b2);
    while(it1!=adj[x].end()&&it1->first<=v) {
        int X = it1->second;
        if(a.count(X))
            a.erase(X);
        else
            a.insert(X);
        it1++;
    }
    while(it2!=adj[y].end()&&it2->first<=v) {
        int X = it2->second;
        if(b.count(X))
            b.erase(X);
        else
            b.insert(X);
        it2++;
    }
    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);
}

Compilation message

potion.cpp: In function 'int calc(std::vector<int>, std::vector<int>)':
potion.cpp:33:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for(int i = 0, j = 0; i < a.size() && j < b.size();i++) {
      |                           ~~^~~~~~~~~~
potion.cpp:33:45: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for(int i = 0, j = 0; i < a.size() && j < b.size();i++) {
      |                                           ~~^~~~~~~~~~

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14464 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14684 KB Output is correct
2 Correct 9 ms 14672 KB Output is correct
3 Correct 7 ms 14672 KB Output is correct
4 Correct 27 ms 29412 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 469 ms 68404 KB Output is correct
2 Correct 446 ms 68424 KB Output is correct
3 Correct 398 ms 58268 KB Output is correct
4 Correct 2422 ms 140176 KB Output is correct
5 Correct 974 ms 69156 KB Output is correct
6 Execution timed out 3043 ms 190052 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 418 ms 68396 KB Output is correct
2 Correct 2487 ms 200632 KB Output is correct
3 Correct 1674 ms 122588 KB Output is correct
4 Correct 2851 ms 189108 KB Output is correct
5 Correct 631 ms 76196 KB Output is correct
6 Execution timed out 3019 ms 189888 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 17872 KB Output is correct
2 Correct 160 ms 17280 KB Output is correct
3 Correct 284 ms 17232 KB Output is correct
4 Correct 1081 ms 19976 KB Output is correct
5 Correct 1110 ms 19632 KB Output is correct
6 Correct 213 ms 16684 KB Output is correct
7 Correct 895 ms 19200 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14464 KB Output is correct
2 Correct 10 ms 14684 KB Output is correct
3 Correct 9 ms 14672 KB Output is correct
4 Correct 7 ms 14672 KB Output is correct
5 Correct 27 ms 29412 KB Output is correct
6 Correct 469 ms 68404 KB Output is correct
7 Correct 446 ms 68424 KB Output is correct
8 Correct 398 ms 58268 KB Output is correct
9 Correct 2422 ms 140176 KB Output is correct
10 Correct 974 ms 69156 KB Output is correct
11 Execution timed out 3043 ms 190052 KB Time limit exceeded
12 Halted 0 ms 0 KB -