Submission #879985

#TimeUsernameProblemLanguageResultExecution timeMemory
879985Elvin_FritlCollider (IZhO11_collider)C++17
100 / 100
128 ms3624 KiB
#include <bits/stdc++.h> using namespace std; #define io \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); typedef long long ll; ll bp(ll n,ll m){ if(m == 0){ return 1; } if(m == 1){ return n; } if(m%2==0){ return bp(n*n,m/2); } return n*bp(n,m-1); } const int N = 1e6 + 545, M = 33, inf = 1e9 + 99; const ll inff = 1e12; int main() { int n,q; string s; cin >> n >> q >> s; vector<pair<int,int>>v; while(q--) { char typ; cin >> typ; if(typ == 'a') { int x , y; cin >> x >> y; v.push_back({x, y}); } else { int ind; cin >> ind; for(int j=(int)v.size()-1;j >= 0;j--) { if(v[j].second == ind) { ind = v[j].first; continue; } if(v[j].second < ind) { ind--; } if(v[j].first <= ind) { ind++; } } cout << s[ind - 1] << endl; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...