oj.uz

Submission #258707

# Submission time Handle Problem Language Result Execution time Memory
258707 2020-08-06T11:54:35 Z dolphingarlic Tram (CEOI13_tram) C++14
65 / 100
 1000 ms 1176 KB 
#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> hmmst;

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;
    hmmst.insert(1);
    hmmst.insert(n);
    for (int i = 1; i <= m; i++) {
        char c;
        cin >> c;
        if (c == 'E') {
            ll best_dist = 0;
            pair<int, int> best_pos;
            for (auto it = next(hmmst.begin()); it != hmmst.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) {
                    if (!used[j.first][j.second]) {
                        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 &&
                            (d != LLONG_MAX || hmmst.size() == 2)) {
                            best_dist = d;
                            best_pos = j;
                        }
                    }
                }
            }
            pos[i] = best_pos;
            used[pos[i].first][pos[i].second] = true;
            hmmst.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][1] && !used[pos[idx].first][2])
                hmmst.erase(pos[idx].first);
        }
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 456 KB Output is correct
2 Correct 7 ms 364 KB Output is correct
3 Correct 34 ms 444 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 492 KB Output is correct
2 Correct 10 ms 364 KB Output is correct
3 Correct 35 ms 444 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 1004 KB Output is correct
2 Correct 9 ms 492 KB Output is correct
3 Correct 39 ms 876 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 884 KB Output is correct
2 Correct 8 ms 364 KB Output is correct
3 Correct 36 ms 876 KB Output is correct

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1087 ms 752 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 1020 ms 1176 KB Time limit exceeded
2 Halted 0 ms 0 KB -