oj.uz

Submission #1043051

# Submission time Handle Problem Language Result Execution time Memory
1043051 2024-08-03T19:51:27 Z beaconmc The Potion of Great Power (CEOI20_potion) C++14
0 / 100
 3000 ms 150608 KB 
#include <bits/stdc++.h>
 
typedef long long 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<unordered_set<ll>> edges[101];
vector<ll> h;
vector<ll> a;
vector<ll> b;

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<unordered_set<ll>> tempedges(10001);
    FOR(i,0,U){
        if (i%100==0) edges[i/100] = tempedges;
        a.push_back(A[i]);
        b.push_back(B[i]);
        if (tempedges[A[i]].count(B[i])) tempedges[A[i]].erase(B[i]);
        else tempedges[A[i]].insert(B[i]);

        if (tempedges[B[i]].count(A[i])) tempedges[B[i]].erase(A[i]);
        else tempedges[B[i]].insert(A[i]);
        
    }
}

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

    sort(A.begin(), A.end());
    sort(B.begin(), B.end());

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

int question(int x, int y, int v) {

    vector<unordered_set<ll>> tempedges;
    tempedges = edges[v/100];

    FOR(i,(v/100)*100, v){
        if (tempedges[a[i]].count(b[i])) tempedges[a[i]].erase(b[i]);
        else tempedges[a[i]].insert(b[i]);

        if (tempedges[b[i]].count(a[i])) tempedges[b[i]].erase(a[i]);
        else tempedges[b[i]].insert(a[i]);
    }
    vector<ll> X,Y;
    for (auto&i : tempedges[x]) X.push_back(i);

    for (auto&i : tempedges[y]) Y.push_back(i);


    return mindiff(X,Y);
}

Compilation message

potion.cpp: In function 'int mindiff(std::vector<long long int>&, std::vector<long long int>&)':
potion.cpp:44:13: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     while (l<A.size() && r<B.size()){
      |            ~^~~~~~~~~
potion.cpp:44:27: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     while (l<A.size() && r<B.size()){
      |                          ~^~~~~~~~~

Subtask #1
0.0 / 0.0

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

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 38 ms 14888 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 46 ms 8644 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Runtime error 27 ms 8616 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3076 ms 150608 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1368 KB Output is correct
2 Runtime error 38 ms 14888 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -