Submission #694898


Source Code Expand

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;

class Program
{
    static void Main()
    {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var sc = new Scan();
        var sumsg = new Segtree<int>(200001, (i, j) => i + j, 0);
        int q = sc.Int, t, x;
        for (int i = 0; i < q; i++)
        {
            sc.Multi(out t, out x);
            if (t == 1)
            {
                sumsg.update(x, 1);
                continue;
            }
            int l = 0, r = 200001, m = 0;
            while (l <= r)
            {
                m = (l + r) >> 1;
                var a = sumsg.run(0, m);
                if (a == x && sumsg.look(m) == 1)
                    break;
                if (a >= x)
                    r = m - 1;
                else
                    l = m + 1;
            }
            sw.WriteLine(m);
            sumsg.update(m, 0);
        }
        sw.Flush();
    }
}
class Scan
{
    public int Int { get { return int.Parse(Console.ReadLine().Trim()); } }
    public long Long { get { return long.Parse(Console.ReadLine().Trim()); } }
    public string Str { get { return Console.ReadLine().Trim(); } }
    public int[] IntArr { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToArray(); } }
    public int[] IntArrWithSep(char sep) { return Console.ReadLine().Trim().Split(sep).Select(int.Parse).ToArray(); }
    public long[] LongArr { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToArray(); } }
    public double[] DoubleArr { get { return Console.ReadLine().Split().Select(double.Parse).ToArray(); } }
    public string[] StrArr { get { return Console.ReadLine().Trim().Split(); } }
    public void Multi(out int a, out int b) { var arr = IntArr; a = arr[0]; b = arr[1]; }
    public void Multi(out int a, out int b, out int c) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; }
    public void Multi(out int a, out int b, out int c, out int d) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; d = arr[3]; }
    public void Multi(out int a, out string b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1]; }
    public void Multi(out string a, out int b) { var arr = StrArr; a = arr[0]; b = int.Parse(arr[1]); }
    public void Multi(out int a, out int b, out string c) { var arr = StrArr; a = int.Parse(arr[0]); b = int.Parse(arr[1]); c = arr[2]; }
    public void Multi(out int a, out char b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1][0]; }
    public void Multi(out char a, out int b) { var arr = StrArr; a = arr[0][0]; b = int.Parse(arr[1]); }
    public void Multi(out long a, out long b) { var arr = LongArr; a = arr[0]; b = arr[1]; }
    public void Multi(out long a, out int b) { var arr = LongArr; a = arr[0]; b = (int)arr[1]; }
    public void Multi(out int a, out long b) { var arr = LongArr; a = (int)arr[0]; b = arr[1]; }
    public void Multi(out string a, out string b) { var arr = StrArr; a = arr[0]; b = arr[1]; }
}
class Segtree<T>
{
    int n;
    T[] tree;
    Func<T, T, T> f;
    T exnum;
    public Segtree(int m, Func<T, T, T> f, T ex)
    {
        this.f = f;
        this.exnum = ex;
        n = 1;
        while (n < m) n <<= 1;

        tree = new T[(n << 1) - 1];
    }
    public Segtree(int m, T ini, Func<T, T, T> f, T ex)
    {
        this.f = f;
        this.exnum = ex;
        n = 1;
        while (n < m) n <<= 1;

        tree = new T[(n << 1) - 1];
        for (int i = 0; i < m; ++i) update(i, ini);
    }
    public void update(int j, T x)
    {
        int i = j + n - 1;
        tree[i] = x;
        while (i > 0)
        {
            i = (i - 1) >> 1;
            tree[i] = f(tree[(i << 1) + 1], tree[(i << 1) + 2]);
        }
    }
    public T look(int i)
    {
        return tree[i + n - 1];
    }
    // [s, t]
    public T run(int s, int t)
    {
        return query(s, t + 1, 0, 0, n);
    }
    T query(int s, int t, int k, int l, int r)
    {
        if (r <= s || t <= l) return exnum;
        if (s <= l && r <= t) return tree[k];

        return f(query(s, t, (k << 1) + 1, l, (l + r) >> 1), query(s, t, (k + 1) << 1, (l + r) >> 1, r));
    }
}

Submission Info

Submission Time
Task C - データ構造
User riantkb
Language C# (Mono 2.10.8.1)
Score 100
Code Size 4341 Byte
Status AC
Exec Time 1556 ms
Memory 12420 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 16
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All 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 124 ms 10392 KB
sample_02.txt AC 122 ms 10400 KB
subtask1_01.txt AC 111 ms 10080 KB
subtask1_02.txt AC 120 ms 10396 KB
subtask1_03.txt AC 121 ms 10452 KB
subtask1_04.txt AC 225 ms 12376 KB
subtask1_05.txt AC 357 ms 12420 KB
subtask1_06.txt AC 126 ms 10580 KB
subtask1_07.txt AC 746 ms 12380 KB
subtask1_08.txt AC 1556 ms 12344 KB
subtask1_09.txt AC 1542 ms 12392 KB
subtask1_10.txt AC 1148 ms 12376 KB
subtask1_11.txt AC 1176 ms 12356 KB
subtask1_12.txt AC 713 ms 12120 KB
subtask1_13.txt AC 1526 ms 12372 KB
subtask1_14.txt AC 1515 ms 12376 KB
subtask1_15.txt AC 1485 ms 12372 KB
subtask1_16.txt AC 1125 ms 12348 KB