Submission #1145287

#	Time	Username	Problem	Language	Result	Execution time	Memory
1145287		Zbyszek99	Inside information (BOI21_servers)	C++20	5 / 100	638 ms	347080 KiB

servers

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

int color_count[4001];
unordered_set<int> colors[4001];

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    int n,k;
    cin >> n >> k;
    rep2(i,1,n)
    {
        colors[i].insert(i);
        color_count[i]++;
    }
    rep(i,n+k-1)
    {
        char t;
        cin >> t;
        if(t == 'S')
        {  
            int a,b;
            cin >> a >> b;
            forall(it,colors[a])
            {
                if(colors[b].find(it) == colors[b].end())
                {
                    color_count[it]++;
                    colors[b].insert(it);
                }
            }
            forall(it,colors[b])
            {
                if(colors[a].find(it) == colors[a].end())
                {
                    color_count[it]++;
                    colors[a].insert(it);
                }
            }
        }
        if(t == 'Q')
        {
            int a,b;
            cin >> a >> b;
            if(colors[a].find(b) != colors[a].end()) cout << "yes\n";
            else cout << "no\n";
        }
        if(t == 'C')
        {
            int x;
            cin >> x;
            cout << color_count[x] << "\n";
        }
    }
}

• Subtask 1-1: 2 / 2
• Subtask 1-2: 3 / 3
• Subtask 2-1: 0 / 2
• Subtask 2-2: 0 / 3
• Subtask 3-1: 0 / 5
• Subtask 3-2: 0 / 5
• Subtask 4-1: 0 / 10
• Subtask 4-2: 0 / 10
• Subtask 5-1: 0 / 12
• Subtask 5-2: 0 / 13
• Subtask 6-1: 0 / 17
• Subtask 6-2: 0 / 18