답안 #894409

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
894409	2023-12-28T09:03:35 Z	nahco314	입자 가속기 (IZhO11_collider)	C++14	0 / 100	10 ms	556 KB

collider

#include <bits/stdc++.h>
using namespace std;

mt19937 mt(0);

int find_num(int n, int m, vector<int> &nexts, vector<pair<int, int>>& looks, int num) {
    int start = -1;
    int start_pos = -1;
    for (auto [id, pos] : looks) {
        if (pos <= num) {
            if (start_pos < pos) {
                start = id;
                start_pos = pos;
            }
        }
    }
    for (int i = start_pos; i < num; i++) {
        start = nexts[start];
    }
    return start;
}

int main() {
    int n, m;
    cin >> n >> m;
    string initial_string;
    cin >> initial_string;

    vector<int> nexts(n + 2);
    for (int i = 0; i < n + 2; i++) {
        if (i == n + 1) {
            nexts[i] = -1;
        } else {
            nexts[i] = i + 1;
        }
    }
    vector<int> prevs(n + 2);
    for (int i = 0; i < n + 2; i++) {
        if (i == 0) {
            prevs[i] = -1;
        } else {
            prevs[i] = i - 1;
        }
    }

    vector<pair<int, int>> looks;
    looks.emplace_back(0, 0);
    uniform_int_distribution<> r(0, n - 1);
    for (int i = 0; i * i < n; i++) {
        int t = r(mt);
        looks.emplace_back(t + 1, t + 1);
    }

    for (int i = 0; i < m; i++) {
        char q;
        cin >> q;

        if (q == 'a') {
            int a, b, x, y;
            cin >> a >> b;
            x = find_num(n, m, nexts, looks, a);
            y = find_num(n, m, nexts, looks, b);

            int px = prevs[x];
            int py = prevs[y];
            int nx = nexts[x];
            int ny = nexts[y];

            if (a < b) {
                nexts[px] = nx;
                prevs[nx] = px;

                nexts[y] = x;
                prevs[x] = y;

                nexts[x] = ny;
                prevs[ny] = x;

                for (int j = 0; j < looks.size(); j++) {
                    if (looks[j].second == a) {
                        looks[j].second = b;
                    } else if (a <= looks[j].second && looks[j].second <= b) {
                        looks[j].second--;
                    }
                }
            } else {
                nexts[py] = x;
                prevs[x] = py;

                nexts[x] = y;
                prevs[y] = x;

                nexts[px] = nx;
                prevs[nx] = px;

                for (int j = 0; j < looks.size(); j++) {
                    if (looks[j].second == a) {
                        looks[j].second = b;
                    } else if (b <= looks[j].second && looks[j].second <= a) {
                        looks[j].second++;
                    }
                }
            }
        } else {
            int num;
            cin >> num;
            int res = find_num(n, m, nexts, looks, num);
            char ans = initial_string[res - 1];
            cout << ans << endl;
        }
    }
}

Compilation message

collider.cpp: In function 'int find_num(int, int, std::vector<int>&, std::vector<std::pair<int, int> >&, int)':
collider.cpp:9:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
    9 |     for (auto [id, pos] : looks) {
      |               ^
collider.cpp: In function 'int main()':
collider.cpp:79:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |                 for (int j = 0; j < looks.size(); j++) {
      |                                 ~~^~~~~~~~~~~~~~
collider.cpp:96:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |                 for (int j = 0; j < looks.size(); j++) {
      |                                 ~~^~~~~~~~~~~~~~

Subtask #1

0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Runtime error	10 ms	556 KB	Execution killed with signal 6
3	Halted	0 ms	0 KB	-