제출 #258628

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
258628		dolphingarlic	전차 (CEOI13_tram)	C++14	0 / 100	1096 ms	544 KiB

tram

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

int cnt = 0;
pair<int, int> pos[100001];
set<pair<int, int>> active;

inline ll sq(int x) { return ll(x) * ll(x); }

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    while (m--) {
        char c;
        cin >> c;
        if (c == 'E') {
            cnt++;
            if (!active.size()) pos[cnt] = {1, 1};
            else {
                pair<ll, pair<int, int>> best = {-1, {0, 0}};
                for (int i = 1; i <= n; i++) {
                    for (int j = 1; j < 3; j++) {
                        ll dist = LLONG_MAX;
                        for (pair<int, int> k : active) {
                            dist = min(dist, sq(k.first - i) + sq(k.second - j));
                        }
                        if (dist > best.first) best = {dist, {i, j}};
                    }
                }
                pos[cnt] = best.second;
            }
            active.insert(pos[cnt]);
            cout << pos[cnt].first << ' ' << pos[cnt].second << '\n';
        } else {
            int i;
            cin >> i;
            active.erase(pos[i]);
        }
    }
    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 15
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 15
• Subtask 8: 0 / 20