Submission #827983

#	Time	Username	Problem	Language	Result	Execution time	Memory
827983		boyliguanhan	The Potion of Great Power (CEOI20_potion)	C++17	56 / 100	3044 ms	169260 KiB

potion

#include<bits/stdc++.h>
//#include "potion.h"
#pragma GCC optimize(2)
#define NN 100100
using namespace std;
int h[NN], n;
map<int, vector<int>> adj[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];
map<int, int> mp[100100];
void curseChanges(int U, int A[], int B[]) {
    for(int i = 0; i < n; i++) adj[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), mp[a][h[b]]--, y.erase(a), mp[b][h[a]]--;
        else x.insert(b), y.insert(a), mp[a][h[b]]++, mp[b][h[a]]++;
        vector<int> x1, y1;
        for(auto j: mp[a]) if(j.second)x1.push_back(j.first);
        for(auto j: mp[b]) if(j.second)y1.push_back(j.first);
        adj[a][i] = x1, adj[b][i] = y1;
    }
}
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) {
    vector<int> a = (--adj[x].upper_bound(v))->second, b = (--adj[y].upper_bound(v))->second;
    vector<int> c, d;
    for(auto i: a) c.push_back(i);
    for(auto i: b) d.push_back(i);
    return calc(c,d);
}

Compilation message (stderr)

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

• Subtask 1: 0 / 0
• Subtask 2: 17 / 17
• Subtask 3: 0 / 14
• Subtask 4: 18 / 18
• Subtask 5: 21 / 21
• Subtask 6: 0 / 30