oj.uz

답안 #111304

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

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;
}
bool so(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 true;
    if (b.t == 0)
        return false;
    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[M];
    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;
}

void solv01()
{
    bool c[N] = {};
    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, 0, t, k));
        c[t] = true;
    }
    for (int i = 1; i <= q; ++i)
    {
        int x, u;
        cin >> x >> u;
        v.push_back(ban0(x, 0, 0, i));
    }

    for (int i = 1; i <= k; ++i)
    {
        if (!c[i])
        {
            for (int i = 1; i <= q; ++i)
                cout << -1 << endl;
            return;
        }
    }

    int g[N] = {};
    multiset<int> s;

    sort(v.begin(), v.end());
    for (int ii = 0; ii < v.size(); ++ii)
    {
        int x = v[ii].x;
        int t = v[ii].t;
        if (t)
        {
            if (!g[t])
                s.erase(g[t]);
            s.insert(x);
            g[t] = x;
        }
        else
        {
            if (!s.empty())
                ans[v[ii].i] = abs(*s.begin() - x);
        }
    }

    memset(g, 0, sizeof g);
    s.clear();

    sort(v.begin(), v.end(), so);
    for (int ii = 0; ii < v.size(); ++ii)
    {
        int x = v[ii].x;
        int t = v[ii].t;
        if (t)
        {
            if (!g[t])
                s.erase(g[t]);
            s.insert(x);
            g[t] = x;
        }
        else
        {
            if (!s.empty())
                ans[v[ii].i] = abs(*s.begin() - x);
        }
    }
}

int main()
{
    //freopen("input.txt", "r", stdin);
    cin >> n >> k >> q;
    if (n <= 60000 && k <= 400)
        solv0();
    else
        solv01();
    return 0;
}

Compilation message

new_home.cpp: In function 'void solv0()':
new_home.cpp:67:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int ii = 0; ii < v.size(); ++ii)
                      ~~~^~~~~~~~~~
new_home.cpp: In function 'void solv01()':
new_home.cpp:141:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int ii = 0; ii < v.size(); ++ii)
                      ~~~^~~~~~~~~~
new_home.cpp:163:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int ii = 0; ii < v.size(); ++ii)
                      ~~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3328 KB Output is correct
2 Correct 4 ms 3200 KB Output is correct
3 Correct 4 ms 3072 KB Output is correct
4 Correct 5 ms 3072 KB Output is correct
5 Correct 7 ms 3328 KB Output is correct
6 Correct 7 ms 3200 KB Output is correct
7 Correct 8 ms 3200 KB Output is correct
8 Correct 6 ms 3200 KB Output is correct
9 Correct 8 ms 3172 KB Output is correct
10 Correct 6 ms 3200 KB Output is correct
11 Correct 6 ms 3200 KB Output is correct
12 Correct 6 ms 3200 KB Output is correct
13 Correct 8 ms 3200 KB Output is correct
14 Correct 6 ms 3200 KB Output is correct
15 Correct 7 ms 3200 KB Output is correct
16 Correct 6 ms 3200 KB Output is correct
17 Correct 7 ms 3200 KB Output is correct
18 Correct 7 ms 3200 KB Output is correct
19 Correct 6 ms 3200 KB Output is correct
20 Correct 7 ms 3200 KB Output is correct
21 Correct 6 ms 3200 KB Output is correct
22 Correct 6 ms 3328 KB Output is correct
23 Correct 6 ms 3200 KB Output is correct
24 Correct 8 ms 3200 KB Output is correct
25 Correct 6 ms 3200 KB Output is correct
26 Correct 6 ms 3200 KB Output is correct
27 Correct 6 ms 3200 KB Output is correct
28 Correct 7 ms 3200 KB Output is correct
29 Correct 6 ms 3200 KB Output is correct
30 Correct 6 ms 3328 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3328 KB Output is correct
2 Correct 4 ms 3200 KB Output is correct
3 Correct 4 ms 3072 KB Output is correct
4 Correct 5 ms 3072 KB Output is correct
5 Correct 7 ms 3328 KB Output is correct
6 Correct 7 ms 3200 KB Output is correct
7 Correct 8 ms 3200 KB Output is correct
8 Correct 6 ms 3200 KB Output is correct
9 Correct 8 ms 3172 KB Output is correct
10 Correct 6 ms 3200 KB Output is correct
11 Correct 6 ms 3200 KB Output is correct
12 Correct 6 ms 3200 KB Output is correct
13 Correct 8 ms 3200 KB Output is correct
14 Correct 6 ms 3200 KB Output is correct
15 Correct 7 ms 3200 KB Output is correct
16 Correct 6 ms 3200 KB Output is correct
17 Correct 7 ms 3200 KB Output is correct
18 Correct 7 ms 3200 KB Output is correct
19 Correct 6 ms 3200 KB Output is correct
20 Correct 7 ms 3200 KB Output is correct
21 Correct 6 ms 3200 KB Output is correct
22 Correct 6 ms 3328 KB Output is correct
23 Correct 6 ms 3200 KB Output is correct
24 Correct 8 ms 3200 KB Output is correct
25 Correct 6 ms 3200 KB Output is correct
26 Correct 6 ms 3200 KB Output is correct
27 Correct 6 ms 3200 KB Output is correct
28 Correct 7 ms 3200 KB Output is correct
29 Correct 6 ms 3200 KB Output is correct
30 Correct 6 ms 3328 KB Output is correct
31 Correct 2799 ms 9492 KB Output is correct
32 Correct 241 ms 7556 KB Output is correct
33 Correct 477 ms 7900 KB Output is correct
34 Correct 2045 ms 7712 KB Output is correct
35 Correct 1262 ms 9548 KB Output is correct
36 Correct 491 ms 9356 KB Output is correct
37 Correct 342 ms 7004 KB Output is correct
38 Correct 272 ms 6792 KB Output is correct
39 Correct 262 ms 6760 KB Output is correct
40 Correct 292 ms 6892 KB Output is correct
41 Correct 467 ms 6876 KB Output is correct
42 Correct 403 ms 6716 KB Output is correct
43 Correct 700 ms 9652 KB Output is correct
44 Correct 450 ms 7032 KB Output is correct
45 Correct 305 ms 7052 KB Output is correct
46 Correct 273 ms 7004 KB Output is correct
47 Correct 247 ms 6524 KB Output is correct
48 Correct 243 ms 6656 KB Output is correct
49 Correct 258 ms 6748 KB Output is correct
50 Correct 416 ms 6696 KB Output is correct
51 Correct 282 ms 6928 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1020 ms 52904 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1063 ms 52668 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3328 KB Output is correct
2 Correct 4 ms 3200 KB Output is correct
3 Correct 4 ms 3072 KB Output is correct
4 Correct 5 ms 3072 KB Output is correct
5 Correct 7 ms 3328 KB Output is correct
6 Correct 7 ms 3200 KB Output is correct
7 Correct 8 ms 3200 KB Output is correct
8 Correct 6 ms 3200 KB Output is correct
9 Correct 8 ms 3172 KB Output is correct
10 Correct 6 ms 3200 KB Output is correct
11 Correct 6 ms 3200 KB Output is correct
12 Correct 6 ms 3200 KB Output is correct
13 Correct 8 ms 3200 KB Output is correct
14 Correct 6 ms 3200 KB Output is correct
15 Correct 7 ms 3200 KB Output is correct
16 Correct 6 ms 3200 KB Output is correct
17 Correct 7 ms 3200 KB Output is correct
18 Correct 7 ms 3200 KB Output is correct
19 Correct 6 ms 3200 KB Output is correct
20 Correct 7 ms 3200 KB Output is correct
21 Correct 6 ms 3200 KB Output is correct
22 Correct 6 ms 3328 KB Output is correct
23 Correct 6 ms 3200 KB Output is correct
24 Correct 8 ms 3200 KB Output is correct
25 Correct 6 ms 3200 KB Output is correct
26 Correct 6 ms 3200 KB Output is correct
27 Correct 6 ms 3200 KB Output is correct
28 Correct 7 ms 3200 KB Output is correct
29 Correct 6 ms 3200 KB Output is correct
30 Correct 6 ms 3328 KB Output is correct
31 Correct 2799 ms 9492 KB Output is correct
32 Correct 241 ms 7556 KB Output is correct
33 Correct 477 ms 7900 KB Output is correct
34 Correct 2045 ms 7712 KB Output is correct
35 Correct 1262 ms 9548 KB Output is correct
36 Correct 491 ms 9356 KB Output is correct
37 Correct 342 ms 7004 KB Output is correct
38 Correct 272 ms 6792 KB Output is correct
39 Correct 262 ms 6760 KB Output is correct
40 Correct 292 ms 6892 KB Output is correct
41 Correct 467 ms 6876 KB Output is correct
42 Correct 403 ms 6716 KB Output is correct
43 Correct 700 ms 9652 KB Output is correct
44 Correct 450 ms 7032 KB Output is correct
45 Correct 305 ms 7052 KB Output is correct
46 Correct 273 ms 7004 KB Output is correct
47 Correct 247 ms 6524 KB Output is correct
48 Correct 243 ms 6656 KB Output is correct
49 Correct 258 ms 6748 KB Output is correct
50 Correct 416 ms 6696 KB Output is correct
51 Correct 282 ms 6928 KB Output is correct
52 Runtime error 207 ms 13324 KB Execution killed with signal 11 (could be triggered by violating memory limits)
53 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3328 KB Output is correct
2 Correct 4 ms 3200 KB Output is correct
3 Correct 4 ms 3072 KB Output is correct
4 Correct 5 ms 3072 KB Output is correct
5 Correct 7 ms 3328 KB Output is correct
6 Correct 7 ms 3200 KB Output is correct
7 Correct 8 ms 3200 KB Output is correct
8 Correct 6 ms 3200 KB Output is correct
9 Correct 8 ms 3172 KB Output is correct
10 Correct 6 ms 3200 KB Output is correct
11 Correct 6 ms 3200 KB Output is correct
12 Correct 6 ms 3200 KB Output is correct
13 Correct 8 ms 3200 KB Output is correct
14 Correct 6 ms 3200 KB Output is correct
15 Correct 7 ms 3200 KB Output is correct
16 Correct 6 ms 3200 KB Output is correct
17 Correct 7 ms 3200 KB Output is correct
18 Correct 7 ms 3200 KB Output is correct
19 Correct 6 ms 3200 KB Output is correct
20 Correct 7 ms 3200 KB Output is correct
21 Correct 6 ms 3200 KB Output is correct
22 Correct 6 ms 3328 KB Output is correct
23 Correct 6 ms 3200 KB Output is correct
24 Correct 8 ms 3200 KB Output is correct
25 Correct 6 ms 3200 KB Output is correct
26 Correct 6 ms 3200 KB Output is correct
27 Correct 6 ms 3200 KB Output is correct
28 Correct 7 ms 3200 KB Output is correct
29 Correct 6 ms 3200 KB Output is correct
30 Correct 6 ms 3328 KB Output is correct
31 Correct 2799 ms 9492 KB Output is correct
32 Correct 241 ms 7556 KB Output is correct
33 Correct 477 ms 7900 KB Output is correct
34 Correct 2045 ms 7712 KB Output is correct
35 Correct 1262 ms 9548 KB Output is correct
36 Correct 491 ms 9356 KB Output is correct
37 Correct 342 ms 7004 KB Output is correct
38 Correct 272 ms 6792 KB Output is correct
39 Correct 262 ms 6760 KB Output is correct
40 Correct 292 ms 6892 KB Output is correct
41 Correct 467 ms 6876 KB Output is correct
42 Correct 403 ms 6716 KB Output is correct
43 Correct 700 ms 9652 KB Output is correct
44 Correct 450 ms 7032 KB Output is correct
45 Correct 305 ms 7052 KB Output is correct
46 Correct 273 ms 7004 KB Output is correct
47 Correct 247 ms 6524 KB Output is correct
48 Correct 243 ms 6656 KB Output is correct
49 Correct 258 ms 6748 KB Output is correct
50 Correct 416 ms 6696 KB Output is correct
51 Correct 282 ms 6928 KB Output is correct
52 Runtime error 1020 ms 52904 KB Execution killed with signal 11 (could be triggered by violating memory limits)
53 Halted 0 ms 0 KB -