oj.uz

Submission #1044533

# Submission time Handle Problem Language Result Execution time Memory
1044533 2024-08-05T10:30:40 Z beaconmc The Potion of Great Power (CEOI20_potion) C++14
38 / 100
 3000 ms 118740 KB 
#include <bits/stdc++.h>
 
typedef int ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
 
using namespace std;
 
 
 
vector<ll> h;
vector<ll> a;
vector<ll> b;



struct cmp {
    bool operator() (ll a, ll b) const {
        return h[a] < h[b];
    }
};

vector<vector<ll>> changes[100001];
vector<set<ll, cmp>> lotchange[100001];
 
void init(int N, int D, int H[]) {
    FOR(i,0,N) h.push_back(H[i]);
}
 
void curseChanges(int U, int A[], int B[]) {
    vector<set<ll, cmp>> tempedges;
    tempedges.resize(100001);
    FOR(i,0,U){



        if (tempedges[A[i]].find(B[i]) != tempedges[A[i]].end()){
            changes[A[i]].push_back({i, B[i]});
            tempedges[A[i]].erase(B[i]);
        }
        else{
            changes[A[i]].push_back({i, B[i]});
            tempedges[A[i]].insert(B[i]);
        }

        if (tempedges[B[i]].find(A[i]) != tempedges[B[i]].end()){
            changes[B[i]].push_back({i, A[i]});
            tempedges[B[i]].erase(A[i]);
        } 
        else{
            changes[B[i]].push_back({i, A[i]});
            tempedges[B[i]].insert(A[i]);
        }
        if ((changes[A[i]].size()-1)%50==0){
            lotchange[A[i]].push_back(tempedges[A[i]]);
        }
        if ((changes[B[i]].size()-1)%50==0){
            lotchange[B[i]].push_back(tempedges[B[i]]);
        }


    }
}
 
int mindiff(set<ll, cmp>&a, set<ll, cmp>&b){
 
    ll ans = 1000000000;
    vector<ll> A,B;
 
    for (auto&i : a) A.push_back(h[i]);
    for (auto&i : b) B.push_back(h[i]);
 

    ll l=0,r=0;
    while (l<A.size() && r<B.size()){
        ans = min(ans, abs(A[l] - B[r]));
        if (A[l] < B[r]) l++;
        else r++;
    }
    return ans;
 
    return ans;
}
 
int question(int x, int y, int v) {

    v--;
    ll ans = 1000000000;


    ll pos = upper_bound(changes[x].begin(), changes[x].end(), vector<ll>{v, 1000000000})-changes[x].begin();
    pos--;
    

    set<ll, cmp> X;
    if (pos >= 0){
        X=lotchange[x][pos/50];

        FOR(i, (pos/50)*50+1, pos+1){

            ll temp = changes[x][i][1];

            if (X.find(temp) != X.end()) X.erase(temp);
            else X.insert(temp);

        }
    }


    pos = upper_bound(changes[y].begin(), changes[y].end(), vector<ll>{v, 1000000000})-changes[y].begin();
    pos--;
    

    set<ll, cmp> Y;
    if (pos >= 0){
        Y=lotchange[y][pos/50];

        FOR(i, (pos/50)*50+1, pos+1){

            ll temp = changes[y][i][1];

            if (Y.find(temp) != Y.end()) Y.erase(temp);
            else Y.insert(temp);

        }
    }






    return mindiff(X,Y);
}

Compilation message

potion.cpp: In function 'int mindiff(std::set<int, cmp>&, std::set<int, cmp>&)':
potion.cpp:75:13: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     while (l<A.size() && r<B.size()){
      |            ~^~~~~~~~~
potion.cpp:75:27: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     while (l<A.size() && r<B.size()){
      |                          ~^~~~~~~~~
potion.cpp: In function 'int question(int, int, int)':
potion.cpp:88:8: warning: unused variable 'ans' [-Wunused-variable]
   88 |     ll ans = 1000000000;
      |        ^~~

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9816 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 10136 KB Output is correct
2 Correct 4 ms 10072 KB Output is correct
3 Correct 4 ms 10072 KB Output is correct
4 Correct 13 ms 11228 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 474 ms 67608 KB Output is correct
2 Correct 440 ms 67672 KB Output is correct
3 Correct 352 ms 38804 KB Output is correct
4 Correct 1832 ms 92720 KB Output is correct
5 Correct 1146 ms 59352 KB Output is correct
6 Execution timed out 3003 ms 118740 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 184 ms 53360 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 13144 KB Output is correct
2 Correct 183 ms 11352 KB Output is correct
3 Correct 261 ms 11352 KB Output is correct
4 Correct 831 ms 13656 KB Output is correct
5 Correct 811 ms 13756 KB Output is correct
6 Correct 133 ms 12120 KB Output is correct
7 Correct 784 ms 12376 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9816 KB Output is correct
2 Correct 4 ms 10136 KB Output is correct
3 Correct 4 ms 10072 KB Output is correct
4 Correct 4 ms 10072 KB Output is correct
5 Correct 13 ms 11228 KB Output is correct
6 Correct 474 ms 67608 KB Output is correct
7 Correct 440 ms 67672 KB Output is correct
8 Correct 352 ms 38804 KB Output is correct
9 Correct 1832 ms 92720 KB Output is correct
10 Correct 1146 ms 59352 KB Output is correct
11 Execution timed out 3003 ms 118740 KB Time limit exceeded
12 Halted 0 ms 0 KB -