제출 #846796

#제출 시각아이디문제언어결과실행 시간메모리
846796Ahmed57Inside information (BOI21_servers)C++17
0 / 100
187 ms944 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n,q;cin>>n>>q; q+=n-1; int mer[n+1]; for(int i = 1;i<=n;i++)mer[i] = -1; int ind = 0; while(q--){ char c;cin>>c; if(c=='S'){ int a,b;cin>>a>>b; if(a>b)swap(a,b); mer[b] = ind++; }if(c=='C'){ int a;cin>>a; if(mer[a]==-1)cout<<1<<endl; else cout<<1+ind-mer[a]<<endl; }if(c=='Q'){ int a,b;cin>>a>>b; if(a==b)cout<<"yes\n"; else{ if(a==1&&mer[b]==-1)cout<<"no\n"; else if(a!=1&&mer[a]<mer[b])cout<<"no\n"; else cout<<"yes\n"; } } } }
#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...