Submission #931229

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
931229	2024-02-21T12:01:35 Z	LucaIlie	The Potion of Great Power (CEOI20_potion)	C++17	14 / 100	2899 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" );
    }*/
}

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

            if ( changes[x][i][mid].time < t )
                l = mid;
            else
                r = mid;
        }
        if ( changes[x][i][l].val != -1 )
            hx.insert( h[changes[x][i][l].val] );
    }
    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;
}

Subtask #1
0 / 0.0

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

Subtask #2
0 / 17.0

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

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	495 ms	74552 KB	Output is correct
2	Correct	483 ms	74632 KB	Output is correct
3	Correct	119 ms	32276 KB	Output is correct
4	Correct	1403 ms	43704 KB	Output is correct
5	Correct	542 ms	61320 KB	Output is correct
6	Correct	2899 ms	58320 KB	Output is correct
7	Correct	597 ms	58744 KB	Output is correct