oj.uz

답안 #931214

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931214 2024-02-21T11:33:06 Z LucaIlie The Potion of Great Power (CEOI20_potion) C++17
0 / 100
 3000 ms 39976 KB 
#include <bits/stdc++.h>

using namespace std;

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> hy;


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

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];
    }
}

int question( int x, int y, int t ) {
    for ( int i = 0; i < n; i++ ) {
        pos[i].clear();
        trust[i].clear();
        trust[i].push_back( i );
    }
    for ( int i = 0; i < t; i++ ) {
        if ( pos[a[i]][b[i]] == 0 ) {
            pos[a[i]][b[i]] = trust[a[i]].size();
            trust[a[i]].push_back( b[i] );

            pos[b[i]][a[i]] = trust[b[i]].size();
            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]][l] );
            swap( trust[a[i]][p], trust[a[i]][l] );
            trust[a[i]].pop_back();

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

    hy.clear();
    for ( int i = 1; i < trust[y].size(); i++ )
        hy.insert( h[trust[y][i]] );

    int minDist = 1e9;
    for ( int i = 1; i < trust[x].size(); i++ ) {
        int hx = h[trust[x][i]];
        auto p = hy.upper_bound( hx );
        if ( p != hy.end() )
            minDist = min( minDist, *p - hx );
        if ( p != hy.begin() ) {
            p--;
            minDist = min( minDist, hx - *p );
        }
    }

    for ( int i = 0; i < t; i++ ) {
        trust[a[i]].clear();
        trust[a[i]].push_back( a[i] );
        pos[a[i]].clear();

        trust[b[i]].clear();
        trust[a[i]].push_back( b[i] );
        pos[b[i]].clear();
    }

    return minDist;
}

Compilation message

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

Subtask #1
0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 8792 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 28 ms 9048 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3049 ms 39976 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3042 ms 39464 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3047 ms 11052 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 8792 KB Incorrect
2 Halted 0 ms 0 KB -