oj.uz

Submission #986633

# Submission time Handle Problem Language Result Execution time Memory
986633 2024-05-21T00:04:01 Z vjudge1 The Potion of Great Power (CEOI20_potion) C++17
17 / 100
 390 ms 49796 KB 
#include<bits/stdc++.h>
using namespace std;
int SSZ=20;
vector<pair<int,int>>C[100100];
map<int,set<int>> temps[100100];
set<int>cur[100100];
int h[100100],ord[100100],rev[100100],CC;
void init(int N, int D, int H[]) {
    map<int,int>mp;
    for(int i=0;i<N;i++)
        mp[h[i]=H[i]],temps[i][-1];
    for(auto&[i,j]:mp)
        j=CC++;
    for(int i=0;i<N;i++)
        rev[ord[i]=mp[h[i]]]=i;
}
void curseChanges(int U, int A[], int B[]) {
    for(int i=0;i<U;i++){
        A[i]=ord[A[i]];
        B[i]=ord[B[i]];
        if(cur[A[i]].count(B[i]))
            cur[A[i]].erase(B[i]),
            cur[B[i]].erase(A[i]);
        else cur[A[i]].insert(B[i]),
            cur[B[i]].insert(A[i]);
        C[A[i]].push_back({i,B[i]});
        C[B[i]].push_back({i,A[i]});
        if(C[A[i]].size()%SSZ==0)
            temps[A[i]][i]=cur[A[i]];
        if(C[B[i]].size()%SSZ==0)
            temps[B[i]][i]=cur[B[i]];
    }
    for(auto&i:cur)
        i.clear();
}
int calc(vector<int>A,vector<int>B){
    int l=0,r=0,ans=1e9;
    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;
}
int question(int x, int y, int v) {
    x=ord[x],y=ord[y];
    vector<int>A,B;
    auto it=--temps[x].lower_bound(v);
    set<int>X=it->second;
    auto it2=lower_bound(C[x].begin(),C[x].end(),make_pair(it->first+1,0));
    for(int i=it2-C[x].begin();i<C[x].size()&&C[x][i].first<v;i++)
        if(X.count(C[x][i].second))
            X.erase(C[x][i].second);
        else X.insert(C[x][i].second);
    for(auto i:X)A.push_back(h[rev[i]]);
    it=--temps[y].upper_bound(v);
    X=it->second;
    it2=lower_bound(C[y].begin(),C[y].end(),make_pair(it->first+1,0));
    for(int i=it2-C[y].begin();i<C[y].size()&&C[y][i].first<v;i++)
        if(X.count(C[y][i].second))
            X.erase(C[y][i].second);
        else X.insert(C[y][i].second);
    for(auto i:X)B.push_back(h[rev[i]]);
    return calc(A,B);
}

Compilation message

potion.cpp: In function 'int calc(std::vector<int>, std::vector<int>)':
potion.cpp:38:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     while(l<A.size()&&r<B.size()){
      |           ~^~~~~~~~~
potion.cpp:38:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     while(l<A.size()&&r<B.size()){
      |                       ~^~~~~~~~~
potion.cpp: In function 'int question(int, int, int)':
potion.cpp:51:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for(int i=it2-C[x].begin();i<C[x].size()&&C[x][i].first<v;i++)
      |                                ~^~~~~~~~~~~~
potion.cpp:59:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |     for(int i=it2-C[y].begin();i<C[y].size()&&C[y][i].first<v;i++)
      |                                ~^~~~~~~~~~~~

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 13144 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 13400 KB Output is correct
2 Correct 5 ms 13400 KB Output is correct
3 Correct 6 ms 12376 KB Output is correct
4 Correct 116 ms 27852 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 390 ms 49796 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 64 ms 29252 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 14936 KB Output is correct
2 Incorrect 33 ms 14260 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 13144 KB Output is correct
2 Correct 7 ms 13400 KB Output is correct
3 Correct 5 ms 13400 KB Output is correct
4 Correct 6 ms 12376 KB Output is correct
5 Correct 116 ms 27852 KB Output is correct
6 Incorrect 390 ms 49796 KB Incorrect
7 Halted 0 ms 0 KB -