Submission #931234

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
931234	2024-02-21T12:09:22 Z	LucaIlie	The Potion of Great Power (CEOI20_potion)	C++17	0 / 100	3000 ms	74812 KB

potion

#include <bits/stdc++.h>

using namespace std;

struct change {
    int time, val;
};

const int MAX_N = 1e5;
const int MAX_M = 2e5;
int n, m, d;
int h[MAX_N], a[MAX_M], b[MAX_M];
unordered_map<int, int> pos[MAX_N];
vector<int> trust[MAX_N];
set<int> hx, hy;
vector<vector<change>> changes[MAX_N];
vector<change> emptyV;

void init( int N, int D, int H[] ) {
    n = N;
    d = D;
    for ( int i = 0; i < n; i++ )
        h[i] = H[i];
    emptyV.push_back( { -1, -1 } );
    for ( int i = 0; i < n; i++ ) {
        trust[i].push_back( i );
        changes[i].push_back( emptyV );
    }
}

void curseChanges( int M, int A[], int B[] ) {
    m = M;
    for ( int i = 0; i < M; i++ ) {
        a[i] = A[i];
        b[i] = B[i];
    }

    for ( int i = 0; i < m; i++ ) {
        if ( changes[a[i]].size() <= trust[a[i]].size() )
            changes[a[i]].push_back( emptyV );
        if ( changes[b[i]].size() <= trust[b[i]].size() )
            changes[b[i]].push_back( emptyV );

        if ( pos[a[i]][b[i]] == 0 ) {
            pos[a[i]][b[i]] = trust[a[i]].size();
            changes[a[i]][trust[a[i]].size()].push_back( { i, b[i] } );
            trust[a[i]].push_back( b[i] );

            pos[b[i]][a[i]] = trust[b[i]].size();
            changes[b[i]][trust[b[i]].size()].push_back( { i, a[i] } );
            trust[b[i]].push_back( a[i] );
        } else {
            int p, l;

            p = pos[a[i]][b[i]], l = trust[a[i]].size() - 1;
            swap( pos[a[i]][b[i]], pos[a[i]][trust[a[i]][l]] );
            swap( trust[a[i]][p], trust[a[i]][l] );
            changes[a[i]][p].push_back( { i, trust[a[i]][p] } );
            changes[a[i]][l].push_back( { i, -1 } );
            pos[a[i]][trust[a[i]][l]] = 0;
            trust[a[i]].pop_back();

            p = pos[b[i]][a[i]], l = trust[b[i]].size() - 1;
            swap( pos[b[i]][a[i]], pos[b[i]][trust[b[i]][l]] );
            swap( trust[b[i]][p], trust[b[i]][l] );
            changes[b[i]][p].push_back( { i, trust[b[i]][p] } );
            changes[b[i]][l].push_back( { i, -1 } );
            pos[b[i]][trust[b[i]][l]] = 0;
            trust[b[i]].pop_back();
        }
    }

    /*for ( int i = 0; i < n; i++ ) {
        printf( "%d: \n", i );
        for ( int j = 1; j <= d; j++ ) {
            for ( change ch: changes[i][j] )
                printf( "%d %d\n", ch.time, ch.val );
            printf( "\n" );
        }
        printf( "\n" );
    }*/
}

vector<int> v;

int question( int x, int y, int t ) {
    hx.clear();
    v.clear();
    for ( int i = 1; i < changes[x].size(); i++ ) {
        v.push_back( i );
    }
    /*hy.clear();
    for ( int i = 1; i < changes[y].size(); i++ ) {
        int l = 0, r = changes[y][i].size();
        while ( r - l > 1 ) {
            int mid = (l + r) / 2;

            if ( changes[y][i][mid].time < t )
                l = mid;
            else
                r = mid;
        }
        if ( changes[y][i][l].val != -1 )
            hy.insert( h[changes[y][i][l].val] );
    }*/
    hy.clear();
    for ( int l: trust[y] ) {
        if ( l == y )
            continue;
        hy.insert( h[l] );
    }

    int minDist = 1e9;
    for ( int l: trust[x] ) {
        if ( l == x )
            continue;

        auto p = hy.upper_bound( h[l] );
        if ( p != hy.end() )
            minDist = min( minDist, *p - h[l] );
        if ( p != hy.begin() ) {
            p--;
            minDist = min( minDist, h[l] - *p );
        }
    }

    return minDist;
}

Compilation message

potion.cpp: In function 'int question(int, int, int)':
potion.cpp:89:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<change> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |     for ( int i = 1; i < changes[x].size(); i++ ) {
      |                      ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 0.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	3 ms	10840 KB	Incorrect
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	4 ms	11096 KB	Incorrect
2	Halted	0 ms	0 KB	-

Subtask #3
0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	503 ms	74560 KB	Output is correct
2	Correct	481 ms	74584 KB	Output is correct
3	Correct	125 ms	32144 KB	Output is correct
4	Correct	1432 ms	43664 KB	Output is correct
5	Correct	545 ms	61524 KB	Output is correct
6	Execution timed out	3017 ms	58148 KB	Time limit exceeded
7	Halted	0 ms	0 KB	-