# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
337873 | beksultan04 | 입자 가속기 (IZhO11_collider) | C++14 | 938 ms | 3552 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 1e6+12,INF=1e9+7;
int dp[201][140001],q[N],n;
main(){
int i,n,m;
scan2(n,m)
string s;
cin>>s;
vector <char> v;
for (i=0;i<n;++i){
v.pb(s[i]);
}
while (m--){
char t;
cin>>t;
if (t == 'q'){
int x;
scan1(x)
x--;
cout <<v[x]<<"\n";
}
else {
int x,y;
scan2(x,y)
char c = v[x-1];
v.erase(v.begin()+x-1);
v.insert(v.begin()+y-1,c);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |