oj.uz

Submission #67558

# Submission time Handle Problem Language Result Execution time Memory
67558 2018-08-15T00:35:22 Z h0ngjun7 None (KOI18_box) C++17
33 / 100
 4 ms 780 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
    int sx, sy, ex, ey;
    sx = sy = -1e9; ex = ey = 1e9;
    for (int i = 0; i < 2; i++) {
        int x, y; scanf("%d%d",&x,&y);
        sx = max(sx, x); sy = max(sy, y);
        scanf("%d%d",&x,&y);
        ex = min(ex, x); ey = min(ey, y);
    }
    if (sx < ex && sy < ey) puts("FACE");
    else if (sx == ex && sy == ey) puts("POINT");
    else if (sx == ex || sy == ey) puts("LINE");
    else puts("NULL");
}

Compilation message

box.cpp: In function 'int main()':
box.cpp:8:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int x, y; scanf("%d%d",&x,&y);
                   ~~~~~^~~~~~~~~~~~~~
box.cpp:10:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&x,&y);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 592 KB Output is correct
4 Correct 3 ms 592 KB Output is correct
5 Correct 2 ms 592 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 2 ms 644 KB Output is correct
8 Correct 2 ms 644 KB Output is correct
9 Correct 2 ms 780 KB Output is correct
10 Correct 2 ms 780 KB Output is correct
11 Correct 2 ms 780 KB Output is correct
12 Correct 3 ms 780 KB Output is correct
13 Correct 3 ms 780 KB Output is correct
14 Correct 3 ms 780 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 780 KB Output is correct
2 Correct 4 ms 780 KB Output is correct
3 Correct 2 ms 780 KB Output is correct
4 Correct 2 ms 780 KB Output is correct
5 Correct 3 ms 780 KB Output is correct
6 Correct 2 ms 780 KB Output is correct
7 Correct 2 ms 780 KB Output is correct
8 Correct 2 ms 780 KB Output is correct
9 Correct 3 ms 780 KB Output is correct
10 Correct 2 ms 780 KB Output is correct
11 Correct 2 ms 780 KB Output is correct
12 Correct 2 ms 780 KB Output is correct
13 Correct 2 ms 780 KB Output is correct
14 Incorrect 2 ms 780 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 592 KB Output is correct
4 Correct 3 ms 592 KB Output is correct
5 Correct 2 ms 592 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 2 ms 644 KB Output is correct
8 Correct 2 ms 644 KB Output is correct
9 Correct 2 ms 780 KB Output is correct
10 Correct 2 ms 780 KB Output is correct
11 Correct 2 ms 780 KB Output is correct
12 Correct 3 ms 780 KB Output is correct
13 Correct 3 ms 780 KB Output is correct
14 Correct 3 ms 780 KB Output is correct
15 Correct 2 ms 780 KB Output is correct
16 Correct 4 ms 780 KB Output is correct
17 Correct 2 ms 780 KB Output is correct
18 Correct 2 ms 780 KB Output is correct
19 Correct 3 ms 780 KB Output is correct
20 Correct 2 ms 780 KB Output is correct
21 Correct 2 ms 780 KB Output is correct
22 Correct 2 ms 780 KB Output is correct
23 Correct 3 ms 780 KB Output is correct
24 Correct 2 ms 780 KB Output is correct
25 Correct 2 ms 780 KB Output is correct
26 Correct 2 ms 780 KB Output is correct
27 Correct 2 ms 780 KB Output is correct
28 Incorrect 2 ms 780 KB Output isn't correct
29 Halted 0 ms 0 KB -