oj.uz

Submission #24896

# Submission time Handle Problem Language Result Execution time Memory
24896 2017-06-17T05:06:34 Z youngyojun 산악 구조대 (JOI13_mountain) C++11
0 / 100
 1000 ms 237904 KB 
#include "grader.h"
#include <stdio.h>
int AnsX, AnsY, X;

bool f1(const int& x1, const int& x2, const int& y1, const int& y2) {
    if(x1 > x2 || y1 > y2) return false;
    if((x2-x1+1) * (y2-y1+1) <= 5) {
        for(int x = x1; x <= x2; x++) for(int y = y1; y <= y2; y++)
            if(X == Measure(x, y)) { AnsX = x; AnsY = y; return true; }
        return false;
    }
    const int midX = (x1+x2)>>1;
    int s = y1, e = y2; for(int mid; s < e;) {
        mid = (s+e+1)>>1;
        const int ret = Measure(midX, mid);
        if(ret == X) { AnsX = midX; AnsY = mid; return true; }
        else if(ret < X) s = mid; else e = mid-1;
    }
    if(X == Measure(midX, s)) { AnsX = midX; AnsY = s; return true; }
    return f1(midX+1, x2, y1, s) || f1(x1, midX-1, s+1, y2);
}
bool f2(const int& x1, const int& x2, const int& y1, const int& y2) {
    if(x1 > x2 || y1 > y2) return false;
    if((x2-x1+1) * (y2-y1+1) <= 5) {
        for(int x = x1; x <= x2; x++) for(int y = y1; y <= y2; y++)
            if(X == Measure(x, y)) { AnsX = x; AnsY = y; return true; }
        return false;
    }
    const int midX = (x1+x2) >> 1;
    int s = y1, e = y2; for(int mid; s < e;) {
        mid = (s+e+1)>>1;
        const int ret = Measure(midX, mid);
        if(ret == X) { AnsX = midX; AnsY = mid; return true; }
        else if(ret < X) s = mid; else e = mid-1;
    }
    if(X == Measure(midX, s)) { AnsX = midX; AnsY = s; return true; }
    return f2(x1, midX-1, y1, s) || f2(midX+1, x2, s+1, y2);
}
bool f3(const int& x1, const int& x2, const int& y1, const int& y2) {
    if(x1 > x2 || y1 > y2) return false;
    if((x2-x1+1) * (y2-y1+1) <= 5) {
        for(int x = x1; x <= x2; x++) for(int y = y1; y <= y2; y++)
            if(X == Measure(x, y)) { AnsX = x; AnsY = y; return true; }
        return false;
    }
    const int midX = (x1+x2) >> 1;
    int s = y1, e = y2; for(int mid; s < e;) {
        mid = (s+e+1)>>1;
        const int ret = Measure(midX, mid);
        if(ret == X) { AnsX = midX; AnsY = mid; return true; }
        else if(ret >= X) s = mid; else e = mid-1;
    }
    if(X == Measure(midX, s)) { AnsX = midX; AnsY = s; return true; }
    return f3(x1, midX-1, y1, s-1) || f3(midX+1, x2, s, y2);
}
bool f4(const int& x1, const int& x2, const int& y1, const int& y2) {
    if(x1 > x2 || y1 > y2) return false;
    if((x2-x1+1) * (y2-y1+1) <= 5) {
        for(int x = x1; x <= x2; x++) for(int y = y1; y <= y2; y++)
            if(X == Measure(x, y)) { AnsX = x; AnsY = y; return true; }
        return false;
    }
    const int midX = (x1+x2) >> 1;
    int s = y1, e = y2; for(int mid; s < e;) {
        mid = (s+e+1)>>1;
        const int ret = Measure(midX, mid);
        if(ret == X) { AnsX = midX; AnsY = mid; return true; }
        else if(ret >= X) s = mid; else e = mid-1;
    }
    if(X == Measure(midX, s)) { AnsX = midX; AnsY = s; return true; }
    return f4(x1, midX-1, s, y2) || f4(midX+1, x2, y1, s-1);
}
void Rescue(int R, int C, int RS, int CS, int _X) {
    X = _X;
    if(!(f1(1, RS, 1, CS) || f2(RS+1, R, 1, CS) || f3(1, RS, CS+1, C) || f4(RS+1, R, CS+1, C))) {
        while(1) puts("FUCK!");
    }
    Pinpoint(AnsX, AnsY);
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 6 ms 256 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 5 ms 360 KB Output is correct
7 Correct 5 ms 432 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Correct 5 ms 320 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 256 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 4 ms 256 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Correct 5 ms 256 KB Output is correct
21 Correct 4 ms 256 KB Output is correct
22 Correct 5 ms 256 KB Output is correct
23 Correct 5 ms 256 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 308 KB Output is correct
27 Correct 5 ms 256 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 256 KB Output is correct
30 Correct 5 ms 256 KB Output is correct
31 Correct 4 ms 384 KB Output is correct
32 Correct 5 ms 256 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 4 ms 256 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 256 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 5 ms 256 KB Output is correct
39 Correct 4 ms 256 KB Output is correct
40 Correct 4 ms 256 KB Output is correct
41 Correct 5 ms 384 KB Output is correct
42 Correct 5 ms 392 KB Output is correct
43 Correct 5 ms 256 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 5 ms 304 KB Output is correct
46 Correct 5 ms 256 KB Output is correct
47 Correct 5 ms 256 KB Output is correct
48 Correct 5 ms 384 KB Output is correct
49 Correct 4 ms 256 KB Output is correct
50 Correct 4 ms 384 KB Output is correct
51 Correct 5 ms 256 KB Output is correct
52 Correct 5 ms 288 KB Output is correct
53 Correct 5 ms 384 KB Output is correct
54 Correct 5 ms 256 KB Output is correct
55 Correct 5 ms 360 KB Output is correct
56 Correct 4 ms 256 KB Output is correct
57 Correct 5 ms 384 KB Output is correct
58 Correct 5 ms 416 KB Output is correct
59 Correct 4 ms 384 KB Output is correct
60 Correct 5 ms 384 KB Output is correct
61 Correct 6 ms 304 KB Output is correct
62 Correct 4 ms 256 KB Output is correct
63 Correct 5 ms 436 KB Output is correct
64 Correct 5 ms 256 KB Output is correct
65 Correct 5 ms 308 KB Output is correct
66 Correct 5 ms 360 KB Output is correct
67 Correct 4 ms 384 KB Output is correct
68 Correct 5 ms 256 KB Output is correct
69 Correct 5 ms 256 KB Output is correct
70 Correct 5 ms 384 KB Output is correct
71 Correct 6 ms 360 KB Output is correct
72 Correct 5 ms 256 KB Output is correct
73 Correct 5 ms 256 KB Output is correct
74 Correct 4 ms 256 KB Output is correct
75 Correct 5 ms 256 KB Output is correct
76 Correct 5 ms 384 KB Output is correct
77 Correct 5 ms 256 KB Output is correct
78 Correct 5 ms 384 KB Output is correct
79 Correct 4 ms 256 KB Output is correct
80 Correct 4 ms 384 KB Output is correct
81 Correct 5 ms 384 KB Output is correct
82 Correct 5 ms 256 KB Output is correct
83 Correct 5 ms 256 KB Output is correct
84 Correct 5 ms 384 KB Output is correct
85 Correct 5 ms 384 KB Output is correct
86 Correct 5 ms 384 KB Output is correct
87 Correct 5 ms 256 KB Output is correct
88 Correct 5 ms 256 KB Output is correct
89 Correct 5 ms 384 KB Output is correct
90 Correct 5 ms 256 KB Output is correct
91 Correct 5 ms 256 KB Output is correct
92 Correct 5 ms 360 KB Output is correct
93 Correct 5 ms 256 KB Output is correct
94 Correct 4 ms 256 KB Output is correct
95 Correct 6 ms 384 KB Output is correct
96 Correct 5 ms 388 KB Output is correct
97 Correct 5 ms 256 KB Output is correct
98 Execution timed out 1091 ms 237904 KB Time limit exceeded
99 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 896 KB Output is correct
2 Execution timed out 1074 ms 224208 KB Time limit exceeded
3 Halted 0 ms 0 KB -