oj.uz

Submission #698654

# Submission time Handle Problem Language Result Execution time Memory
698654 2023-02-14T07:11:27 Z vjudge1 New Home (APIO18_new_home) C++17
0 / 100
 5000 ms 16376 KB 
#include <bits/stdc++.h>
#define endl '\n'
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int ll
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
using namespace std;
const int N = 1e8 + 10, mod = 1e9 + 7;
struct st{
    int x, t, a, b;
};
int n, k, q;
vector<st> v;
signed main()
{
    FAST;
    cin >> n >> k >> q;
    v.resize(n);
    for(int i = 0; i < n; i++) cin >> v[i].x >> v[i].t >> v[i].a >> v[i].b;
    while(q--) {
        int l, y;
        cin >> l >> y;
        bool vis[k+1];
        vector<int> ans;
        int cnt = 0;
        for(int i = 1; i <= k; i++) vis[i] = 0;
        for(int i = 0; i < n; i++) {
            if(v[i].a <= y && v[i].b >= y) {
                if(!vis[v[i].t]) {
                    cnt++;
                    vis[v[i].t] = 1;
                }
                ans.push_back(v[i].x);
            }
        }
        if(cnt == k) {
            sort(all(ans));
            cout << max(abs(l - ans[0]), abs(l - ans[ans.size() - 1])) << endl;
        }
        else cout << -1 << endl;
    }
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Incorrect 1 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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Incorrect 1 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 5042 ms 16376 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 5094 ms 16192 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Incorrect 1 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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -