# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
673918 | 2022-12-22T12:04:05 Z | Baytoro | 입자 가속기 (IZhO11_collider) | C++17 | 425 ms | 2476 KB |
#include <bits/stdc++.h> using namespace std; #define ios ios::sync_with_stdio(false); cin.tie(NULL); #define pb push_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define fr first #define sc second #define int long long #define endl '\n' void fopn(string name){ freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout); } const int INF=1e18,mod=998244353; int n,q; const int N=1e5+5; void solve(){ int n,q;cin>>n>>q; vector<char> v(n);; for(int i=0;i<n;i++) cin>>v[i]; while(q--){ char t; cin>>t; if(t=='a'){ int a,b;cin>>a>>b; a--,b--; char val=v[a]; v.erase(v.begin()+a); v.insert(v.begin()+b,val); } else{ int x;cin>>x; cout<<v[x-1]<<endl; } } } main(){ //fopn("newbarn"); //ios; int T=1; //cin>>T; while(T--){ solve(); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 9 ms | 340 KB | Output is correct |
3 | Correct | 22 ms | 468 KB | Output is correct |
4 | Correct | 144 ms | 1928 KB | Output is correct |
5 | Correct | 272 ms | 1948 KB | Output is correct |
6 | Correct | 328 ms | 2232 KB | Output is correct |
7 | Correct | 386 ms | 2416 KB | Output is correct |
8 | Correct | 173 ms | 2276 KB | Output is correct |
9 | Correct | 425 ms | 2476 KB | Output is correct |
10 | Correct | 322 ms | 2404 KB | Output is correct |