oj.uz

Submission #1043839

# Submission time Handle Problem Language Result Execution time Memory
1043839 2024-08-04T22:24:10 Z beaconmc The Potion of Great Power (CEOI20_potion) C++14
17 / 100
 2550 ms 117428 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;

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

    FOR(i,0,U){

        if ((changes[A[i]].size())%50==0 && changes[A[i]].size()!=0){
            lotchange[A[i]].push_back(tempedges[A[i]]);
        }
        if ((changes[B[i]].size())%50==0 && changes[B[i]].size()!=0){
            lotchange[B[i]].push_back(tempedges[B[i]]);
        }

        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]);
        }


    }
}
 
int mindiff(set<ll>&a, set<ll>&b){
 
    ll ans = 1000000000;
    vector<pair<ll,ll>> A,B;
 
    for (auto&i : a) A.push_back(make_pair(h[i], (ll)0));
    for (auto&i : b) A.push_back(make_pair(h[i], (ll) 1));
 
    sort(A.begin(), A.end());
    if (A.size()==0) return ans;
    FOR(i,0,A.size()-1){
        if (A[i].second != A[i+1].second) ans = min(ans, abs(A[i].first-A[i+1].first));
    }
 
    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();

    set<ll> X = lotchange[x][pos/50];


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

        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();

    set<ll> Y = lotchange[y][pos/50];


    FOR(i, (pos/50)*50, pos){
        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>&, std::set<int>&)':
potion.cpp:4:33: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define FOR(i,x,y) for(ll i=x; i<y; i++)
......
   70 |     FOR(i,0,A.size()-1){
      |         ~~~~~~~~~~~~~~           
potion.cpp:70:5: note: in expansion of macro 'FOR'
   70 |     FOR(i,0,A.size()-1){
      |     ^~~
potion.cpp: In function 'int question(int, int, int)':
potion.cpp:81:8: warning: unused variable 'ans' [-Wunused-variable]
   81 |     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 3 ms 10072 KB Output is correct
2 Correct 4 ms 9944 KB Output is correct
3 Correct 4 ms 10072 KB Output is correct
4 Correct 18 ms 16888 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 269 ms 63196 KB Output is correct
2 Correct 271 ms 63192 KB Output is correct
3 Incorrect 100 ms 44972 KB Incorrect
4 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 273 ms 63252 KB Output is correct
2 Correct 2550 ms 117428 KB Output is correct
3 Incorrect 598 ms 81616 KB Incorrect
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 12632 KB Output is correct
2 Runtime error 12 ms 14596 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9816 KB Output is correct
2 Correct 3 ms 10072 KB Output is correct
3 Correct 4 ms 9944 KB Output is correct
4 Correct 4 ms 10072 KB Output is correct
5 Correct 18 ms 16888 KB Output is correct
6 Correct 269 ms 63196 KB Output is correct
7 Correct 271 ms 63192 KB Output is correct
8 Incorrect 100 ms 44972 KB Incorrect
9 Halted 0 ms 0 KB -