답안 #49022 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
49022	2018-05-21T10:22:31 Z	BThero	새 집 (APIO18_new_home)	C++17	5 / 100	5000 ms	8052 KB

new_home

// Why am I so stupid? :c
#include <bits/stdc++.h>

#define pb push_back
#define mp make_pair

#define all(x) (x).begin(), (x).end()

#define fi first
#define se second

typedef long long ll;

using namespace std;

const int INF = 1e9;

struct shop {
    int x, tp, l, r;

    shop() {
        x = tp = l = r = 0;
    }
} arr[300005];

struct que {
    int x, t;

    que() {
        x = t = 0;
    }
} req[300005];

int ans[300005];

int mn[300005];

int n, k, q;

void solve() {
    scanf("%d %d %d", &n, &k, &q);

    for (int i = 1; i <= n; ++i) {
        scanf("%d %d", &arr[i].x, &arr[i].tp);
        scanf("%d %d", &arr[i].l, &arr[i].r);
    }

    for (int i = 1; i <= q; ++i) {
        scanf("%d %d", &req[i].x, &req[i].t);
    }

    for (int i = 1; i <= q; ++i) {
        for (int j = 1; j <= k; ++j) {
            mn[j] = INF;
        }

        for (int j = 1; j <= n; ++j) {
            if (arr[j].l <= req[i].t && req[i].t <= arr[j].r) {
                mn[arr[j].tp] = min(mn[arr[j].tp], abs(req[i].x - arr[j].x));
            }
        }

        for (int j = 1; j <= k; ++j) {
            ans[i] = max(ans[i], mn[j]);
        }
    }

    for (int i = 1; i <= q; ++i) {
        if (ans[i] == INF) {
            ans[i] = -1;
        }

        printf("%d\n", ans[i]);
    }
}

int main() {
#ifdef BThero
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif // BThero

    int tt = 1;

    while (tt--) {
        solve();
    }

    return 0;
}

Compilation message

new_home.cpp: In function 'void solve()':
new_home.cpp:41:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &n, &k, &q);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:44:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &arr[i].x, &arr[i].tp);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:45:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &arr[i].l, &arr[i].r);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:49:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &req[i].x, &req[i].t);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	7288 KB	Output is correct
2	Correct	7 ms	7396 KB	Output is correct
3	Correct	7 ms	7448 KB	Output is correct
4	Correct	7 ms	7448 KB	Output is correct
5	Correct	10 ms	7504 KB	Output is correct
6	Correct	8 ms	7508 KB	Output is correct
7	Correct	8 ms	7584 KB	Output is correct
8	Correct	9 ms	7584 KB	Output is correct
9	Correct	10 ms	7584 KB	Output is correct
10	Correct	9 ms	7584 KB	Output is correct
11	Correct	9 ms	7584 KB	Output is correct
12	Correct	9 ms	7584 KB	Output is correct
13	Correct	10 ms	7588 KB	Output is correct
14	Correct	9 ms	7588 KB	Output is correct
15	Correct	9 ms	7588 KB	Output is correct
16	Correct	8 ms	7588 KB	Output is correct
17	Correct	8 ms	7692 KB	Output is correct
18	Correct	8 ms	7696 KB	Output is correct
19	Correct	8 ms	7696 KB	Output is correct
20	Correct	10 ms	7696 KB	Output is correct
21	Correct	8 ms	7696 KB	Output is correct
22	Correct	8 ms	7696 KB	Output is correct
23	Correct	9 ms	7696 KB	Output is correct
24	Correct	8 ms	7696 KB	Output is correct
25	Correct	8 ms	7696 KB	Output is correct
26	Correct	7 ms	7696 KB	Output is correct
27	Correct	7 ms	7696 KB	Output is correct
28	Correct	8 ms	7788 KB	Output is correct
29	Correct	8 ms	7788 KB	Output is correct
30	Correct	7 ms	7788 KB	Output is correct

Subtask #2
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	7288 KB	Output is correct
2	Correct	7 ms	7396 KB	Output is correct
3	Correct	7 ms	7448 KB	Output is correct
4	Correct	7 ms	7448 KB	Output is correct
5	Correct	10 ms	7504 KB	Output is correct
6	Correct	8 ms	7508 KB	Output is correct
7	Correct	8 ms	7584 KB	Output is correct
8	Correct	9 ms	7584 KB	Output is correct
9	Correct	10 ms	7584 KB	Output is correct
10	Correct	9 ms	7584 KB	Output is correct
11	Correct	9 ms	7584 KB	Output is correct
12	Correct	9 ms	7584 KB	Output is correct
13	Correct	10 ms	7588 KB	Output is correct
14	Correct	9 ms	7588 KB	Output is correct
15	Correct	9 ms	7588 KB	Output is correct
16	Correct	8 ms	7588 KB	Output is correct
17	Correct	8 ms	7692 KB	Output is correct
18	Correct	8 ms	7696 KB	Output is correct
19	Correct	8 ms	7696 KB	Output is correct
20	Correct	10 ms	7696 KB	Output is correct
21	Correct	8 ms	7696 KB	Output is correct
22	Correct	8 ms	7696 KB	Output is correct
23	Correct	9 ms	7696 KB	Output is correct
24	Correct	8 ms	7696 KB	Output is correct
25	Correct	8 ms	7696 KB	Output is correct
26	Correct	7 ms	7696 KB	Output is correct
27	Correct	7 ms	7696 KB	Output is correct
28	Correct	8 ms	7788 KB	Output is correct
29	Correct	8 ms	7788 KB	Output is correct
30	Correct	7 ms	7788 KB	Output is correct
31	Execution timed out	5013 ms	7864 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	5018 ms	8052 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	5077 ms	8052 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	7288 KB	Output is correct
2	Correct	7 ms	7396 KB	Output is correct
3	Correct	7 ms	7448 KB	Output is correct
4	Correct	7 ms	7448 KB	Output is correct
5	Correct	10 ms	7504 KB	Output is correct
6	Correct	8 ms	7508 KB	Output is correct
7	Correct	8 ms	7584 KB	Output is correct
8	Correct	9 ms	7584 KB	Output is correct
9	Correct	10 ms	7584 KB	Output is correct
10	Correct	9 ms	7584 KB	Output is correct
11	Correct	9 ms	7584 KB	Output is correct
12	Correct	9 ms	7584 KB	Output is correct
13	Correct	10 ms	7588 KB	Output is correct
14	Correct	9 ms	7588 KB	Output is correct
15	Correct	9 ms	7588 KB	Output is correct
16	Correct	8 ms	7588 KB	Output is correct
17	Correct	8 ms	7692 KB	Output is correct
18	Correct	8 ms	7696 KB	Output is correct
19	Correct	8 ms	7696 KB	Output is correct
20	Correct	10 ms	7696 KB	Output is correct
21	Correct	8 ms	7696 KB	Output is correct
22	Correct	8 ms	7696 KB	Output is correct
23	Correct	9 ms	7696 KB	Output is correct
24	Correct	8 ms	7696 KB	Output is correct
25	Correct	8 ms	7696 KB	Output is correct
26	Correct	7 ms	7696 KB	Output is correct
27	Correct	7 ms	7696 KB	Output is correct
28	Correct	8 ms	7788 KB	Output is correct
29	Correct	8 ms	7788 KB	Output is correct
30	Correct	7 ms	7788 KB	Output is correct
31	Execution timed out	5013 ms	7864 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	7288 KB	Output is correct
2	Correct	7 ms	7396 KB	Output is correct
3	Correct	7 ms	7448 KB	Output is correct
4	Correct	7 ms	7448 KB	Output is correct
5	Correct	10 ms	7504 KB	Output is correct
6	Correct	8 ms	7508 KB	Output is correct
7	Correct	8 ms	7584 KB	Output is correct
8	Correct	9 ms	7584 KB	Output is correct
9	Correct	10 ms	7584 KB	Output is correct
10	Correct	9 ms	7584 KB	Output is correct
11	Correct	9 ms	7584 KB	Output is correct
12	Correct	9 ms	7584 KB	Output is correct
13	Correct	10 ms	7588 KB	Output is correct
14	Correct	9 ms	7588 KB	Output is correct
15	Correct	9 ms	7588 KB	Output is correct
16	Correct	8 ms	7588 KB	Output is correct
17	Correct	8 ms	7692 KB	Output is correct
18	Correct	8 ms	7696 KB	Output is correct
19	Correct	8 ms	7696 KB	Output is correct
20	Correct	10 ms	7696 KB	Output is correct
21	Correct	8 ms	7696 KB	Output is correct
22	Correct	8 ms	7696 KB	Output is correct
23	Correct	9 ms	7696 KB	Output is correct
24	Correct	8 ms	7696 KB	Output is correct
25	Correct	8 ms	7696 KB	Output is correct
26	Correct	7 ms	7696 KB	Output is correct
27	Correct	7 ms	7696 KB	Output is correct
28	Correct	8 ms	7788 KB	Output is correct
29	Correct	8 ms	7788 KB	Output is correct
30	Correct	7 ms	7788 KB	Output is correct
31	Execution timed out	5013 ms	7864 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

답안 #49022

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 0 / 7.0

Subtask #3 0 / 10.0

Subtask #4 0 / 23.0

Subtask #5 0 / 35.0

Subtask #6 0 / 20.0

Subtask #1
5.0 / 5.0

Subtask #2
0 / 7.0

Subtask #3
0 / 10.0

Subtask #4
0 / 23.0

Subtask #5
0 / 35.0

Subtask #6
0 / 20.0