Submission #902612

#TimeUsernameProblemLanguageResultExecution timeMemory
902612simona1230Inside information (BOI21_servers)C++17
5 / 100
1724 ms63920 KiB
#include <bits/stdc++.h> using namespace std; int n,k; int in[4001][4001]; void slow() { for(int i=1;i<=n;i++) in[i][i]=1; for(int i=1;i<=n+k-1;i++) { char c; cin>>c; int x,y; if(c=='S') { cin>>x>>y; for(int j=1;j<=n;j++) { in[x][j]=in[y][j]=max(in[x][j],in[y][j]); } } if(c=='C') { cin>>x; int cnt=0; for(int j=1;j<=n;j++) cnt+=in[j][x]; cout<<cnt<<endl; } if(c=='Q') { cin>>x>>y; if(in[x][y])cout<<"yes"<<endl; else cout<<"no"<<endl; } } } int t[120001]; void subt2() { t[1]=1; int sec=1; for(int i=1;i<=n+k-1;i++) { char c; cin>>c; if(c=='S') { int x,y; cin>>x>>y; t[max(x,y)]=sec++; } if(c=='Q') { int x,y; cin>>x>>y; if(t[y]&&t[y]<t[x])cout<<"yes"<<endl; else cout<<"no"<<endl; } if(c=='C') { int x; cin>>x; if(t[x]==0)cout<<1<<endl; else cout<<sec-t[x]<<endl; } } } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin>>n>>k; if(n<=4000)slow(); else subt2(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...