Submission #446879

#	Time	Username	Problem	Language	Result	Execution time	Memory
446879		wiwiho	Inside information (BOI21_servers)	C++14	5 / 100	100 ms	5776 KiB

servers

#include <bits/stdc++.h>

#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define iter(a) a.begin(), a.end()
#define lsort(a) sort(iter(a))

using namespace std;

typedef long long ll;

using pii = pair<int, int>;

int n, k;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n >> k; 

    int q = n + k - 1;
    vector<int> tm(n + 1);
    vector<pair<int, pii>> qry;
    for(int i = 0; i < q; i++){

        string s;
        cin >> s;
        if(s == "S"){
            int u, v;
            cin >> u >> v;
            if(u > v) swap(u, v);
            assert(u == 1);
            tm[v] = i;
        }
        else if(s == "Q"){
            int a, d;
            cin >> a >> d;
            qry.eb(mp(i, mp(a, d)));
        }
        else{
            int d;
            cin >> d;
            qry.eb(mp(i, mp(-1, d)));
        }

    }

    vector<int> tmp = tm;
    tmp.erase(tmp.begin());
    tmp.erase(tmp.begin());
    lsort(tmp);
    
    for(auto i : qry){
        int t = i.F;
        int a = i.S.F, d = i.S.S;
        if(a != -1){
            if(a == d){
                cout << "yes\n";
                continue;
            }
            if(tm[d] > t || tm[a] > t){
                cout << "no\n";
                continue;
            }
            if(a == 1 || d == 1 || tm[d] < tm[a]) cout << "yes\n";
            else cout << "no\n";
            continue;
        }

        if(d == 1){
            int ans = upper_bound(iter(tmp), t) - tmp.begin() + 1;
            cout << ans << "\n";
            continue;
        }

        if(tm[d] > t){
            cout << "1\n";
            continue;
        }

        int st = lower_bound(iter(tmp), tm[d]) - tmp.begin();
        int ed = upper_bound(iter(tmp), t) - tmp.begin();
        cout << ed - st + 1 << "\n";

    }

    return 0;
}

• Subtask 1: 0 / 2.5
• Subtask 2: 0 / 2.5
• Subtask 3: 2.5 / 2.5
• Subtask 4: 2.5 / 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