oj.uz

답안 #863631

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
863631 2023-10-20T16:13:53 Z Ahmed_Solyman Inside information (BOI21_servers) C++14
2.5 / 100
 3500 ms 377136 KB 
/*
In the name of Allah
made by: Ahmed_Solyman
*/
#include <bits/stdc++.h>
#include <ext/rope>
 
using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define fil(arr,x) memset(arr,x,sizeof(arr))
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
    return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
    cout<<(x?"yes":"no")<<endl;
}
struct DSU{
    vector<int>P,sz,t;
    void init(int n){
        P.resize(n+5);
        sz.assign(n+5,1);
        t.resize(n+5);
        for(int i=0;i<n+5;i++)P[i]=i;
    }
    int find(int node,int time){
        if(P[node]==node || t[node]>time)return node;
        return P[node]=find(P[node],time);
    }
    bool unite(int a,int b,int time){
        int p1=find(a,time);
        int p2=find(b,time);
        if(p1==p2){
            return 0;
        }
        if(sz[p1]>sz[p2]){
            swap(p1,p2);
        }
        P[p1]=p2;
        sz[p2]+=sz[p1];
        t[p1]=time;
        return 1;
    }
}d;
int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    #ifndef ONLINE_JUDGE
    //freopen("input.in", "r", stdin);
    //freopen("output.out", "w", stdout);
    #endif
    fast
    int n,q;cin>>n>>q;
    d.init(n+5);q+=n;
    q--;
    int cnt=1;
    vector<int>u(n+5),v(n+5);
    set<int>adj[n+5];
    for(int i=1;i<=n;i++)adj[i].insert(i);
    while(q--){
        char c;cin>>c;
        if(c=='S'){
            int a,b;cin>>a>>b;
            u[cnt]=a;v[cnt]=b;
            for(int i=1;i<=n;i++){
                if(adj[b].find(i)!=adj[b].end()){
                    adj[a].insert(i);
                }
                if(adj[a].find(i)!=adj[a].end()){
                    adj[b].insert(i);
                }
            }
            assert(d.unite(a,b,cnt++));
        }
        else if(c=='Q'){
            int a,b;cin>>a>>b;
            bool ok=adj[a].find(b)!=adj[a].end();
            person_bool(ok);
        }
    }
    return 0;
}

Subtask #1
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 604 KB Output is correct
2 Correct 160 ms 2388 KB Output is correct
3 Correct 635 ms 47848 KB Output is correct
4 Correct 151 ms 1872 KB Output is correct
5 Correct 134 ms 1696 KB Output is correct
6 Correct 2432 ms 377136 KB Output is correct

Subtask #2
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 604 KB Output is correct
2 Correct 160 ms 2388 KB Output is correct
3 Correct 635 ms 47848 KB Output is correct
4 Correct 151 ms 1872 KB Output is correct
5 Correct 134 ms 1696 KB Output is correct
6 Correct 2432 ms 377136 KB Output is correct
7 Incorrect 18 ms 604 KB Extra information in the output file
8 Halted 0 ms 0 KB -

Subtask #3
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 852 KB Output is correct
2 Execution timed out 3512 ms 50340 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 852 KB Output is correct
2 Execution timed out 3512 ms 50340 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 600 KB Output is correct
2 Execution timed out 3563 ms 15096 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 600 KB Output is correct
2 Execution timed out 3563 ms 15096 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 696 KB Output is correct
2 Execution timed out 3559 ms 14764 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 696 KB Output is correct
2 Execution timed out 3559 ms 14764 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #9
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 604 KB Output is correct
2 Execution timed out 3572 ms 14588 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 604 KB Output is correct
2 Execution timed out 3572 ms 14588 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #11
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 816 KB Output is correct
2 Correct 185 ms 2388 KB Output is correct
3 Correct 632 ms 47796 KB Output is correct
4 Correct 188 ms 1876 KB Output is correct
5 Correct 157 ms 1796 KB Output is correct
6 Correct 2534 ms 377032 KB Output is correct
7 Correct 18 ms 856 KB Output is correct
8 Execution timed out 3584 ms 51688 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 816 KB Output is correct
2 Correct 185 ms 2388 KB Output is correct
3 Correct 632 ms 47796 KB Output is correct
4 Correct 188 ms 1876 KB Output is correct
5 Correct 157 ms 1796 KB Output is correct
6 Correct 2534 ms 377032 KB Output is correct
7 Correct 18 ms 856 KB Output is correct
8 Execution timed out 3584 ms 51688 KB Time limit exceeded
9 Halted 0 ms 0 KB -