oj.uz

Submission #1044566

# Submission time Handle Problem Language Result Execution time Memory
1044566 2024-08-05T10:47:34 Z beaconmc The Potion of Great Power (CEOI20_potion) C++14
100 / 100
 2778 ms 109800 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;
 
 
 
basic_string<ll> h;
basic_string<ll> a;
basic_string<ll> b;



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

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

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 3 ms 10072 KB Output is correct
3 Correct 2 ms 10072 KB Output is correct
4 Correct 9 ms 11024 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 59452 KB Output is correct
2 Correct 213 ms 59336 KB Output is correct
3 Correct 244 ms 29896 KB Output is correct
4 Correct 1420 ms 84156 KB Output is correct
5 Correct 569 ms 51792 KB Output is correct
6 Correct 2392 ms 109764 KB Output is correct
7 Correct 665 ms 50672 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 231 ms 59608 KB Output is correct
2 Correct 1985 ms 106748 KB Output is correct
3 Correct 1455 ms 76204 KB Output is correct
4 Correct 2553 ms 109228 KB Output is correct
5 Correct 452 ms 62724 KB Output is correct
6 Correct 2679 ms 109512 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 12632 KB Output is correct
2 Correct 182 ms 11096 KB Output is correct
3 Correct 246 ms 10840 KB Output is correct
4 Correct 853 ms 13144 KB Output is correct
5 Correct 791 ms 13144 KB Output is correct
6 Correct 125 ms 11864 KB Output is correct
7 Correct 683 ms 11860 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 9816 KB Output is correct
2 Correct 3 ms 10072 KB Output is correct
3 Correct 3 ms 10072 KB Output is correct
4 Correct 2 ms 10072 KB Output is correct
5 Correct 9 ms 11024 KB Output is correct
6 Correct 227 ms 59452 KB Output is correct
7 Correct 213 ms 59336 KB Output is correct
8 Correct 244 ms 29896 KB Output is correct
9 Correct 1420 ms 84156 KB Output is correct
10 Correct 569 ms 51792 KB Output is correct
11 Correct 2392 ms 109764 KB Output is correct
12 Correct 665 ms 50672 KB Output is correct
13 Correct 231 ms 59608 KB Output is correct
14 Correct 1985 ms 106748 KB Output is correct
15 Correct 1455 ms 76204 KB Output is correct
16 Correct 2553 ms 109228 KB Output is correct
17 Correct 452 ms 62724 KB Output is correct
18 Correct 2679 ms 109512 KB Output is correct
19 Correct 29 ms 12632 KB Output is correct
20 Correct 182 ms 11096 KB Output is correct
21 Correct 246 ms 10840 KB Output is correct
22 Correct 853 ms 13144 KB Output is correct
23 Correct 791 ms 13144 KB Output is correct
24 Correct 125 ms 11864 KB Output is correct
25 Correct 683 ms 11860 KB Output is correct
26 Correct 970 ms 55448 KB Output is correct
27 Correct 1523 ms 76228 KB Output is correct
28 Correct 1595 ms 80164 KB Output is correct
29 Correct 1301 ms 84304 KB Output is correct
30 Correct 2778 ms 109768 KB Output is correct
31 Correct 2335 ms 109800 KB Output is correct
32 Correct 2541 ms 109500 KB Output is correct