oj.uz

Submission #258696

# Submission time Handle Problem Language Result Execution time Memory
258696 2020-08-06T11:40:33 Z dolphingarlic Tram (CEOI13_tram) C++14
25 / 100
 1000 ms 1076 KB 
/*
CEOI 2013 Tram
- Medians
*/

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

int n, m;
bool used[150001][3];
pair<int, int> pos[30001];
set<int> interesting;

ll dist(pair<int, int> A, pair<int, int> B) {
    return ll(B.first - A.first) * ll(B.first - A.first) + ll(B.second - A.second) * ll(B.second - A.second);
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    interesting.insert(1);
    interesting.insert(n);
    for (int i = 1; i <= m; i++) {
        char c;
        cin >> c;
        if (c == 'E') {
            // for (int j : interesting) cout << j << ' ';
            // cout << ": ";
            ll best_dist = 0;
            pair<int, int> best_pos;

            for (auto it = next(interesting.begin()); it != interesting.end(); it++) {
                int mid1 = (*it + *prev(it)) / 2, mid2 = (*it + *prev(it) + 1) / 2;
                vector<pair<int, int>> cand = {{*prev(it), 1}, {*prev(it), 2}, {mid1, 1}, {mid1, 2}, {mid2, 1}, {mid2, 2}, {*it, 1}, {*it, 2}};
                for (pair<int, int> j : cand) {
                    ll d = LLONG_MAX;
                    for (pair<int, int> k : cand) {
                        if (used[k.first][k.second]) {
                            d = min(d, dist(j, k));
                        }
                    }
                    if (d > best_dist) {
                        best_dist = d;
                        best_pos = j;
                    }
                }
            }

            pos[i] = best_pos;
            used[pos[i].first][pos[i].second] = true;
            interesting.insert(pos[i].first);
            cout << pos[i].first << ' ' << pos[i].second << '\n';
        } else {
            int idx;
            cin >> idx;
            used[pos[idx].first][pos[idx].second] = false;
            if (pos[idx].first != 1 && pos[idx].first != n && !(used[pos[idx].first][0] || used[pos[idx].first][1]))
                interesting.erase(pos[idx].first);
        }
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 2 ms 364 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 492 KB Output is correct
2 Incorrect 12 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 206 ms 492 KB Output is correct
2 Incorrect 13 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 231 ms 876 KB Output is correct
2 Incorrect 21 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 217 ms 876 KB Output is correct
2 Incorrect 20 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1084 ms 620 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1053 ms 1076 KB Time limit exceeded
2 Halted 0 ms 0 KB -