답안 #111301

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
111301 2019-05-14T17:35:33 Z SamAnd 새 집 (APIO18_new_home) C++17
12 / 100
3259 ms 29220 KB
#include <bits/stdc++.h>
using namespace std;
const int N = 300005;

int n, q, k;

int ans[N];

struct ban0
{
    int x;
    int u;
    int t;
    int i;
    ban0(){}
    ban0(int x, int u, int t, int i)
    {
        this->x = x;
        this->u = u;
        this->t = t;
        this->i = i;
    }
};
bool operator<(const ban0& a, const ban0& b)
{
    if (a.u < b.u)
        return true;
    if (a.u > b.u)
        return false;
    if (a.t == 0)
        return false;
    if (b.t == 0)
        return true;
    return false;
}

void solv0()
{
    vector<ban0> v;
    for (int i = 1; i <= n; ++i)
    {
        int x, t, l, r;
        cin >> x >> t >> l >> r;
        v.push_back(ban0(x, l, t, i));
        v.push_back(ban0(x, r + 1, -t, i));
    }
    for (int i = 1; i <= q; ++i)
    {
        int x, u;
        cin >> x >> u;
        v.push_back(ban0(x, u, 0, i));
    }
    sort(v.begin(), v.end());
    multiset<int> s[402];
    for (int ii = 0; ii < v.size(); ++ii)
    {
        int x = v[ii].x;
        int t = v[ii].t;
        if (t > 0)
        {
            s[t].insert(x);
        }
        else if (t < 0)
        {
            s[-t].erase(s[-t].find(x));
        }
        else
        {
            bool z = false;
            int maxu = 0;
            for (int i = 1; i <= k; ++i)
            {
                if (s[i].empty())
                {
                    z = true;
                    break;
                }
                multiset<int>::iterator it = s[i].lower_bound(x);
                int minu = 1000000000;
                if (it != s[i].end())
                    minu = abs(*it - x);
                --it;
                if (it != s[i].end())
                    minu = min(minu, abs(*it - x));
                maxu = max(maxu, minu);
            }
            if (z)
                ans[v[ii].i] = -1;
            else
                ans[v[ii].i] = maxu;
        }
    }
    for (int i = 1; i <= q; ++i)
        cout << ans[i] << endl;
}

int main()
{
    //freopen("input.txt", "r", stdin);
    cin >> n >> k >> q;
    solv0();
    return 0;
}

Compilation message

new_home.cpp: In function 'void solv0()':
new_home.cpp:55:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int ii = 0; ii < v.size(); ++ii)
                      ~~~^~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 7 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 6 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 4 ms 384 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 4 ms 412 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 4 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 7 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 6 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 4 ms 384 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 4 ms 412 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 4 ms 384 KB Output is correct
31 Correct 3259 ms 6848 KB Output is correct
32 Correct 207 ms 4680 KB Output is correct
33 Correct 397 ms 4956 KB Output is correct
34 Correct 2415 ms 5060 KB Output is correct
35 Correct 1527 ms 6724 KB Output is correct
36 Correct 463 ms 6692 KB Output is correct
37 Correct 415 ms 4580 KB Output is correct
38 Correct 279 ms 4580 KB Output is correct
39 Correct 344 ms 4716 KB Output is correct
40 Correct 304 ms 4624 KB Output is correct
41 Correct 453 ms 4708 KB Output is correct
42 Correct 374 ms 4580 KB Output is correct
43 Correct 766 ms 6996 KB Output is correct
44 Correct 389 ms 4708 KB Output is correct
45 Correct 280 ms 4580 KB Output is correct
46 Correct 254 ms 4580 KB Output is correct
47 Correct 233 ms 4580 KB Output is correct
48 Correct 232 ms 4580 KB Output is correct
49 Correct 245 ms 4580 KB Output is correct
50 Correct 370 ms 4588 KB Output is correct
51 Correct 276 ms 4700 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Runtime error 859 ms 29220 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Runtime error 727 ms 28928 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 7 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 6 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 4 ms 384 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 4 ms 412 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 4 ms 384 KB Output is correct
31 Correct 3259 ms 6848 KB Output is correct
32 Correct 207 ms 4680 KB Output is correct
33 Correct 397 ms 4956 KB Output is correct
34 Correct 2415 ms 5060 KB Output is correct
35 Correct 1527 ms 6724 KB Output is correct
36 Correct 463 ms 6692 KB Output is correct
37 Correct 415 ms 4580 KB Output is correct
38 Correct 279 ms 4580 KB Output is correct
39 Correct 344 ms 4716 KB Output is correct
40 Correct 304 ms 4624 KB Output is correct
41 Correct 453 ms 4708 KB Output is correct
42 Correct 374 ms 4580 KB Output is correct
43 Correct 766 ms 6996 KB Output is correct
44 Correct 389 ms 4708 KB Output is correct
45 Correct 280 ms 4580 KB Output is correct
46 Correct 254 ms 4580 KB Output is correct
47 Correct 233 ms 4580 KB Output is correct
48 Correct 232 ms 4580 KB Output is correct
49 Correct 245 ms 4580 KB Output is correct
50 Correct 370 ms 4588 KB Output is correct
51 Correct 276 ms 4700 KB Output is correct
52 Runtime error 185 ms 6436 KB Execution killed with signal 11 (could be triggered by violating memory limits)
53 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 7 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 6 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 4 ms 384 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 4 ms 412 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 4 ms 384 KB Output is correct
31 Correct 3259 ms 6848 KB Output is correct
32 Correct 207 ms 4680 KB Output is correct
33 Correct 397 ms 4956 KB Output is correct
34 Correct 2415 ms 5060 KB Output is correct
35 Correct 1527 ms 6724 KB Output is correct
36 Correct 463 ms 6692 KB Output is correct
37 Correct 415 ms 4580 KB Output is correct
38 Correct 279 ms 4580 KB Output is correct
39 Correct 344 ms 4716 KB Output is correct
40 Correct 304 ms 4624 KB Output is correct
41 Correct 453 ms 4708 KB Output is correct
42 Correct 374 ms 4580 KB Output is correct
43 Correct 766 ms 6996 KB Output is correct
44 Correct 389 ms 4708 KB Output is correct
45 Correct 280 ms 4580 KB Output is correct
46 Correct 254 ms 4580 KB Output is correct
47 Correct 233 ms 4580 KB Output is correct
48 Correct 232 ms 4580 KB Output is correct
49 Correct 245 ms 4580 KB Output is correct
50 Correct 370 ms 4588 KB Output is correct
51 Correct 276 ms 4700 KB Output is correct
52 Runtime error 859 ms 29220 KB Execution killed with signal 11 (could be triggered by violating memory limits)
53 Halted 0 ms 0 KB -