답안 #673293

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
673293 2022-12-20T05:58:52 Z Alihan_8 입자 가속기 (IZhO11_collider) C++17
100 / 100
379 ms 2500 KB
#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, q; cin >> n >> q;
    vector <char> p(n);
    for ( auto &i: p ) cin >> i;
    while ( q-- ){
        char t; cin >> t;
        if ( t == 'a' ){
            int l, r; cin >> l >> r;
            --l, --r;
            char val = p[l];
            p.erase(p.begin()+l);
            p.insert(p.begin()+r, val);
        }
        else{
            int x; cin >> x;
            cout << p[--x] << ln;
        }
    }

    cout << '\n';
}

Compilation message

collider.cpp: In function 'void IO(std::string)':
collider.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
collider.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 14 ms 532 KB Output is correct
4 Correct 104 ms 1872 KB Output is correct
5 Correct 195 ms 2032 KB Output is correct
6 Correct 275 ms 2256 KB Output is correct
7 Correct 295 ms 2444 KB Output is correct
8 Correct 137 ms 2348 KB Output is correct
9 Correct 379 ms 2500 KB Output is correct
10 Correct 257 ms 2420 KB Output is correct