Submission #1651364


Source Code Expand

#include<bits/stdc++.h>
using namespace std;

int N = 200020,Q;
int bit[200030] = {0};

void init()
{
    for(int i = 0; i < N; i++)bit[i] = 0;
    return;
}

void add(int i,int x)
{
    while(i <= N)
    {
        bit[i] += x;
        i += i & -i;
    }
    return;
}

int sum(int i)
{
    int res = 0;
    while(i > 0)
    {
        res += bit[i];
        i -= i & -i;
    }
    return res;
}

int main()
{
    scanf("%d",&Q);
    init();
    for(int i = 0; i < Q; i++)
    {
        int k,x;
        scanf("%d%d",&k,&x);
        if(k == 1)add(x,1);
        else
        {
            int l = 1,r = N;
            while(r - l > 0)
            {
                int mid = (l + r) / 2;
                if(sum(mid) < x)l = mid + 1;
                else r = mid;
            }
            printf("%d\n",l);
            add(l,-1);
        }
    }
    return 0;
}

Submission Info

Submission Time
Task C - データ構造
User unit
Language C++14 (GCC 5.4.1)
Score 100
Code Size 917 Byte
Status AC
Exec Time 81 ms
Memory 1664 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:36:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&Q);
                   ^
./Main.cpp:41:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&k,&x);
                            ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 18
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt
Case Name Status Exec Time Memory
sample_01.txt AC 2 ms 1024 KB
sample_02.txt AC 1 ms 1024 KB
subtask1_01.txt AC 1 ms 1024 KB
subtask1_02.txt AC 1 ms 1024 KB
subtask1_03.txt AC 1 ms 1024 KB
subtask1_04.txt AC 7 ms 1024 KB
subtask1_05.txt AC 14 ms 1152 KB
subtask1_06.txt AC 2 ms 1024 KB
subtask1_07.txt AC 37 ms 1152 KB
subtask1_08.txt AC 81 ms 1664 KB
subtask1_09.txt AC 81 ms 1664 KB
subtask1_10.txt AC 59 ms 1280 KB
subtask1_11.txt AC 60 ms 1280 KB
subtask1_12.txt AC 36 ms 1024 KB
subtask1_13.txt AC 81 ms 1664 KB
subtask1_14.txt AC 81 ms 1664 KB
subtask1_15.txt AC 61 ms 1664 KB
subtask1_16.txt AC 53 ms 1408 KB