A. Jiufeng and sign-in questions (pass rate) (2021 Niuke Winter Holiday Algorithm Basic Training Camp 4 original)

Portal

Idea: Check in the question, then pay attention to 50% or more passed in any time in the question.

Code:

#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {
   
   {1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int  inf = 0x3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll   mod = 1e9+7;
const int  N = 2e5 + 5;

inline void read(int &x){
    char t=getchar();
    while(!isdigit(t)) t=getchar();
    for(x=t^48,t=getchar();isdigit(t);t=getchar()) x=x*10+(t^48);
}

int m, n;
int a[50], w[50], vis[50];

signed main()
{
    IOS;

    cin >> m >> n;
    while(m --){
        int pr; string re;
        cin >> pr >> re;
        if(re=="AC") a[pr] ++;
        else w[pr] ++;
        if(a[pr]<w[pr]) vis[pr] = 1;
    }
    int flag = 1;
    for(int i = 1; i <= n; i ++){
        if(!vis[i] && a[i]+w[i]){
            cout << i << " ";
            flag = 0;
        }
    }
    if(flag) cout << -1 << endl;

    return 0;
}