oj.uz

답안 #1039213

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1039213 2024-07-30T14:38:05 Z Tonyl The Potion of Great Power (CEOI20_potion) C++17
0 / 100
 109 ms 62452 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
#define REP(i,n) for (int i = 0; i < n; i++)
#define trav(a,x) for (auto &a : x)
#define all(x) (x).begin(), (x).end()
#define submit(a,b) cout << a << " " << b << endl
#define D(x) //cerr << #x << ": " << x << endl;

struct Collection {
    set<int> nums;

    void flip(int i) {
        if (nums.count(i)) nums.erase(i);
        else nums.insert(i);
        /*
        bool cont = 0;
        trav(a,nums) {if (a == i) {cont = 1;}}

        if (!cont) {
            nums.push_back(i);
            return;
        } 
        vi nums2;
        trav(a,nums) {
            if (a != i) nums2.push_back(a);
        }
        nums = nums2;*/
    }

    vi get_all() {
        return vi(all(nums));
    }
};

const int MAX_N = 2e5;

int n,d;
vi hs;

Collection fr[MAX_N];

int get_ans(vi a, vi b) {
    int best = 1e9;

    vi h1, h2;
    trav(aa, a) {
        h1.push_back(hs[aa]);
    }
    sort(all(h1));
    trav(bb, b) {
        h2.push_back(hs[bb]);
    }
    sort(all(h2));

    int i = 0;
    trav(hb, h2) {
        while (h1[i] < hb && i != h1.size()-1) i++;
        best = min(best, abs(hb - h1[i]));
        if (i!=0) best = min(best, abs(hb - h1[i-1]));
    }

    return best;
}

void init(int N, int D, int H[]) {
    n = N; d = D;
    REP(i,n) hs.push_back(H[i]);
}

void curseChanges(int U, int A[], int B[]) {
    REP(uu, U) {
        int a = A[uu];
        int b = B[uu];
        fr[a].flip(b);
        fr[b].flip(a);
    }
}

int question(int x, int y, int v) {
    return get_ans(fr[x].get_all(), fr[y].get_all());
}

Compilation message

potion.cpp: In function 'int get_ans(vi, vi)':
potion.cpp:60:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         while (h1[i] < hb && i != h1.size()-1) i++;
      |                              ~~^~~~~~~~~~~~~~

Subtask #1
0.0 / 0.0

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

Subtask #2
0 / 17.0

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

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 109 ms 62452 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 30.0

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