zoukankan      html  css  js  c++  java
  • 奇·数组容量设置保守导致Wrong answer!

    C. Thor
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can't count the number of unread notifications generated by those applications (maybe Loki put a curse on it so he can't).

    q events are about to happen (in chronological order). They are of three types:

    1. Application x generates a notification (this new notification is unread).//添加一个App未读通知;
    2. Thor reads all notifications generated so far by application x (he may re-read some notifications).//读取x类型的所有通知;
    3. Thor reads the first t notifications generated by phone applications (notifications generated in first t events of the first type). It's guaranteed that there were at least t events of the first type before this event. Please note that he doesn't read first t unread notifications, he just reads the very first t notifications generated on his phone and he may re-read some of them in this operation.//从最开始的位置开始读取t个通知;

    Please help Thor and tell him the number of unread notifications after each event. You may assume that initially there are no notifications in the phone.

    Input

    The first line of input contains two integers n and q (1 ≤ n, q ≤ 300 000) — the number of applications and the number of events to happen.

    The next q lines contain the events. The i-th of these lines starts with an integer typei — type of the i-th event. Iftypei = 1 or typei = 2 then it is followed by an integer xi. Otherwise it is followed by an integer ti(1 ≤ typei ≤ 3, 1 ≤ xi ≤ n, 1 ≤ ti ≤ q).

    Output

    Print the number of unread notifications after each event.

    Examples
    input
    3 4
    1 3
    1 1
    1 2
    2 3
    output
    1
    2
    3
    2
    input
    4 6
    1 2
    1 4
    1 2
    3 3
    1 3
    1 3
    output
    1
    2
    3
    0
    1
    2
    Note

    In the first sample:

    1. Application 3 generates a notification (there is 1 unread notification).
    2. Application 1 generates a notification (there are 2 unread notifications).
    3. Application 2 generates a notification (there are 3 unread notifications).
    4. Thor reads the notification generated by application 3, there are 2 unread notifications left.

    In the second sample test:

    1. Application 2 generates a notification (there is 1 unread notification).
    2. Application 4 generates a notification (there are 2 unread notifications).
    3. Application 2 generates a notification (there are 3 unread notifications).
    4. Thor reads first three notifications and since there are only three of them so far, there will be no unread notification left.
    5. Application 3 generates a notification (there is 1 unread notification).
    6. Application 3 generates a notification (there are 2 unread notifications).
    #include<iostream>
    #include<cstring>
    #include<cstdio>
    #include<algorithm>
    #include<queue>
    using namespace std;
    queue<int> q;
    int ans, readedMax = 0;
    int unread[300005], readed[300005], p[300005];//设置为300000时Wrong answer on test 38
    void f(int t, int y) {
        if(t == 1) {
            ans++;
            unread[y]++;
            q.push(y);
        } else if(t == 2) {
            ans -= unread[y];
            readed[y] += unread[y];
            unread[y] = 0;
        } else {
            if(y > readedMax) {
                int temp = y - readedMax;
                while(temp-- && !q.empty()) {
                int x = q.front();
                q.pop();
                p[x]++;
                    if(p[x] > readed[x]) {
                        ans--;
                        readed[x]++;
                        unread[x]--;
                    }
                }
                readedMax = y;
            }
        }
    }
    int main() {
        int a, y, t, x;
        scanf("%d %d", &a, &y);
        for(int i = 0; i < y; i++) {
            scanf("%d %d", &t, &x);
            f(t, x);
            printf("%d
    ",ans);
        }
        return 0;
    }
  • 相关阅读:
    PCB Genesis加邮票孔(邮票孔增加方向判断--左右上下)实现算法
    PCB SLOT槽孔数量计算方法,同CAM350孔数一致 实现方法
    从上到下打印二叉树II
    数据结构与算法(2)---顺序表
    栈的压入弹出序列
    包含min函数的栈
    顺时针打印矩阵
    数据结构与算法(1)--绪论
    反转链表
    数值的整数次方(快速幂)
  • 原文地址:https://www.cnblogs.com/ACMessi/p/5783787.html
Copyright © 2011-2022 走看看