# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
902630 | 2024-01-10T21:21:49 Z | simona1230 | Inside information (BOI21_servers) | C++17 | 168 ms | 5932 KB |
#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=2; 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]||x==1&&t[y]||y==1&&t[x]||x==y)cout<<"yes"<<endl; else cout<<"no"<<endl; } if(c=='C') { int x; cin>>x; if(t[x]==0)cout<<1<<endl; else if(x==1)cout<<sec-1<<endl; else cout<<sec-t[x]+1<<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; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 144 ms | 896 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 144 ms | 896 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 158 ms | 592 KB | Output is correct |
2 | Correct | 161 ms | 2900 KB | Output is correct |
3 | Correct | 167 ms | 5932 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 158 ms | 592 KB | Output is correct |
2 | Correct | 161 ms | 2900 KB | Output is correct |
3 | Correct | 167 ms | 5932 KB | Output is correct |
4 | Correct | 148 ms | 1656 KB | Output is correct |
5 | Correct | 168 ms | 5692 KB | Output is correct |
6 | Correct | 168 ms | 5212 KB | Output is correct |
7 | Correct | 156 ms | 5152 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 143 ms | 596 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 143 ms | 596 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 145 ms | 592 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 145 ms | 592 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 160 ms | 752 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 160 ms | 752 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 146 ms | 684 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 146 ms | 684 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |