oj.uz

Submission #702313

# Submission time Handle Problem Language Result Execution time Memory
702313 2023-02-23T13:59:02 Z josanneo22 New Home (APIO18_new_home) C++17
0 / 100
 5000 ms 6556 KB 
#include <bits/stdc++.h>
using namespace std;
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int t = 1;
    while (t--) {
        int n, type, q;
        cin >> n >> type >> q;
        vector<int> loc(n+3), tp(n + 3), st(n + 3), ed(n + 3);
        for (int i = 0; i < n; i++) {
            cin >> loc[i] >> tp[i] >> st[i] >> ed[i];
            tp[i]--;
        }
        vector<int> cur_type(type + 5, 0);
        for (int i = 0; i < q; i++) {
            int u, ti; cin >> u >> ti;
            int ans = -1;
            vector<int> cur_type(n, INT_MAX);
            for (int j = 0; j < n; j++) {
                if (st[j] <= ti && ti<=ed[j]) {
                    ans = max(ans, abs(u - loc[j]));
                    cur_type[tp[j]] = min(cur_type[tp[j]], abs(u - loc[j]));
                }
            }
            int ok = 1;
            for (int p = 0; p < type; p++) {
                if (cur_type[p] ==INT_MAX) ok = 0;
            }
            if (ok == 0) cout << "-1\n";
            else cout << ans << '\n';
        }
    }
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -