oj.uz

답안 #923780

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
923780 2024-02-07T18:30:09 Z n3rm1n Ball Machine (BOI13_ballmachine) C++17
7.53968 / 100
 70 ms 12836 KB 
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
const int MAXN = 1e5 + 10;
void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
int n, que;
int p[MAXN], root;
vector < int > g[MAXN];

void read()
{
    cin >> n >> que;
    for (int i = 1; i <= n; ++ i)
    {
        cin >> p[i];
        if(!p[i])root = i;
        else g[p[i]].push_back(i);
    }
}

int points[MAXN], cnt;
void dfs0(int beg)
{

    int nb;
    for (int i = 0; i < g[beg].size(); ++ i)
    {
        nb = g[beg][i];
        dfs0(nb);
    }
    cnt ++;
    points[beg] = cnt;
}

int used[MAXN];
priority_queue < pair < int, int > > q;
int query_type1(int x)
{
    int v = 0;
    while(x --)
    {
        v = q.top().second;
        //cout << v << endl;
        used[v] = 1;
        q.pop();
    }
    return v;
}
int main()
{
    speed();

    read();
    dfs0(root);


    for (int i = 1; i <= n; ++ i)
        q.push(make_pair(-points[i], i));


    int t, x;
    while(que --)
    {
        cin >> t >> x;
        if(t == 1)
            cout << query_type1(x) << endl;
        else
        {
            q.push(make_pair(-points[x], x));
            used[x] = 0;
            cout << 0 << endl;
        }
    }
    return 0;
}

Compilation message

ballmachine.cpp: In function 'void dfs0(int)':
ballmachine.cpp:31:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for (int i = 0; i < g[beg].size(); ++ i)
      |                     ~~^~~~~~~~~~~~~~~

Subtask #1
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 3164 KB Output isn't correct
2 Incorrect 40 ms 5584 KB Output isn't correct
3 Incorrect 32 ms 5844 KB Output isn't correct
4 Incorrect 1 ms 3160 KB Output isn't correct
5 Incorrect 1 ms 3420 KB Output isn't correct
6 Incorrect 1 ms 3416 KB Output isn't correct
7 Incorrect 2 ms 3420 KB Output isn't correct
8 Incorrect 1 ms 3420 KB Output isn't correct
9 Incorrect 4 ms 3420 KB Output isn't correct
10 Incorrect 10 ms 4084 KB Output isn't correct
11 Incorrect 42 ms 5592 KB Output isn't correct
12 Incorrect 38 ms 5916 KB Output isn't correct
13 Incorrect 42 ms 5664 KB Output isn't correct

Subtask #2
6.42857142857 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 5336 KB Output is correct
2 Incorrect 57 ms 9340 KB Output isn't correct
3 Incorrect 33 ms 6692 KB Output isn't correct
4 Incorrect 29 ms 5592 KB Output isn't correct
5 Incorrect 27 ms 5336 KB Output isn't correct
6 Incorrect 28 ms 5400 KB Output isn't correct
7 Incorrect 27 ms 4832 KB Output isn't correct
8 Correct 21 ms 5368 KB Output is correct
9 Incorrect 44 ms 9688 KB Output isn't correct
10 Incorrect 56 ms 9304 KB Output isn't correct
11 Incorrect 48 ms 9224 KB Output isn't correct
12 Incorrect 49 ms 7892 KB Output isn't correct
13 Correct 38 ms 11736 KB Output is correct
14 Incorrect 46 ms 6712 KB Output isn't correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 26 ms 6620 KB Output isn't correct
2 Incorrect 51 ms 8040 KB Output isn't correct
3 Incorrect 39 ms 10972 KB Output isn't correct
4 Incorrect 43 ms 8660 KB Output isn't correct
5 Incorrect 35 ms 8136 KB Output isn't correct
6 Incorrect 35 ms 8148 KB Output isn't correct
7 Incorrect 37 ms 7384 KB Output isn't correct
8 Incorrect 35 ms 10972 KB Output isn't correct
9 Incorrect 51 ms 9792 KB Output isn't correct
10 Incorrect 49 ms 9240 KB Output isn't correct
11 Incorrect 55 ms 9176 KB Output isn't correct
12 Incorrect 49 ms 8056 KB Output isn't correct
13 Incorrect 56 ms 12756 KB Output isn't correct
14 Incorrect 42 ms 6520 KB Output isn't correct

Subtask #4
1.11111111111 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 56 ms 9788 KB Output isn't correct
2 Incorrect 52 ms 8136 KB Output isn't correct
3 Correct 44 ms 12836 KB Output is correct
4 Incorrect 51 ms 9696 KB Output isn't correct
5 Incorrect 48 ms 9176 KB Output isn't correct
6 Incorrect 62 ms 9720 KB Output isn't correct
7 Incorrect 70 ms 8000 KB Output isn't correct
8 Correct 41 ms 12756 KB Output is correct
9 Incorrect 38 ms 6504 KB Output isn't correct