제출 #696297

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
696297		Dan4Life	Inside information (BOI21_servers)	C++17	5 / 100	1973 ms	64856 KiB

servers

#include <bits/stdc++.h>
using namespace std;
const int mxN = (int)4010;

int n, k, pos[mxN];
int S[mxN][mxN];

int32_t main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n >> k; int sz = 1;
    for(int i = 1; i <= n; i++) S[i][i]=1;
    for(int _ = 0; _ < n+k-1; _++){
        char t; int x, y;
        cin >> t >> x;
        if(t=='S'){
            cin >> y;
            if(x>y)swap(x,y);
            pos[y]=sz++;
            for(int i = 1; i <= n; i++)
                S[x][i]=S[y][i]=S[x][i]|S[y][i];
        }
        else if(t=='Q'){
            cin >> y;
            if(1) cout << (S[x][y]?"yes":"no");
            else if(x==1) cout << (pos[y]?"yes":"no");
            else if(y==1) cout << (pos[x]?"yes":"no");
            else cout << (pos[x]>=pos[y] and pos[x] and pos[y]?"yes":"no");
        }
        else{
            int cnt = 0;
            for(int i = 1; i <= n; i++) cnt+=S[i][x];
            if(1) cout << cnt;
            else if(!pos[x] and x!=1) cout << 1;
            else cout << sz-pos[x]+1;
        }
        if(t!='S') cout << "\n";
    }
}

• Subtask 1: 2.5 / 2.5
• Subtask 2: 2.5 / 2.5
• Subtask 3: 0 / 2.5
• Subtask 4: 0 / 2.5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 12.5
• Subtask 10: 0 / 12.5
• Subtask 11: 0 / 17.5
• Subtask 12: 0 / 17.5