Submission #31639

# Submission time Handle Problem Language Result Execution time Memory
31639 2017-08-30T07:40:49 Z Diuven 산악 구조대 (JOI13_mountain) C++11
0 / 100
14 ms 512 KB
#include "grader.h"
#include <utility>
#include <vector>
using namespace std;
struct pt{
	int x=0, y=0;
	pt(int a, int b): x(a), y(b){};
	pt(){};
};
typedef pair<pt, int> ppi;
int R, X;
vector<ppi> ans;
int check(pt p){return Measure(p.x, p.y);}
int check(int a, int b){return Measure(a,b);}
void f(pt x){ans.push_back(ppi(x, check(x)));}
pt srh(pt a, pt b){
	//a가 작고, b가 크다.
	int s, e, m, dx=0, dy=0, d;
	if(a.x==b.x)
		s=a.y, e=b.y, dy=s<e?1:-1;
	else
		s=a.x, e=b.x, dx=s<e?1:-1;
	pt now;
	for(d=dx+dy, m=(s+e+(d<0?1:0))/2; s!=e; m=(s+e+(d<0?1:0))/2){
		if(dx==0)	now=pt(a.x, m);
		else		now=pt(m, a.y);
		if(check(now)<X)	s=m+d;
		else				e=m;
	}
	if(dx==0)	now=pt(a.x, s);
	else		now=pt(s, a.y);
	//X이상인 점
	return now;
}
void Rescue(int R, int C, int RS, int CS, int _X){
	X=_X;
	pt top=pt(RS, CS);
	pt a=srh(pt(1,CS), top), b=srh(pt(RS,1), top), c=srh(pt(R, CS), top), d=srh(pt(RS, C), top);
	f(a), f(b), f(c), f(d), f(top);
	pt p=pt(a.x,b.y), q=pt(c.x,b.y), r=pt(c.x,d.y), s=pt(a.x,d.y);
	f(srh(p,a)), f(srh(p,b)), f(srh(q,b)), f(srh(q,c)), f(srh(r,c)), f(srh(r,d)), f(srh(s,d)), f(srh(s,a));
	for(auto& p:ans){
		if(p.second==X){
			Pinpoint(p.first.x, p.first.y);
			return;
		}
	}
	Pinpoint(ans[0].first.x, ans[0].first.y);
	//nope
	return;
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 308 KB Output is correct
7 Correct 5 ms 324 KB Output is correct
8 Correct 4 ms 256 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 5 ms 384 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 4 ms 256 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 256 KB Output is correct
22 Correct 4 ms 256 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 5 ms 256 KB Output is correct
25 Correct 4 ms 256 KB Output is correct
26 Correct 4 ms 384 KB Output is correct
27 Correct 4 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 256 KB Output is correct
32 Correct 5 ms 256 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 256 KB Output is correct
35 Correct 4 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 4 ms 256 KB Output is correct
39 Correct 5 ms 256 KB Output is correct
40 Correct 5 ms 384 KB Output is correct
41 Correct 5 ms 256 KB Output is correct
42 Correct 4 ms 384 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 5 ms 256 KB Output is correct
45 Correct 5 ms 384 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 256 KB Output is correct
49 Correct 5 ms 296 KB Output is correct
50 Correct 6 ms 256 KB Output is correct
51 Correct 5 ms 384 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 5 ms 384 KB Output is correct
54 Correct 5 ms 384 KB Output is correct
55 Correct 7 ms 384 KB Output is correct
56 Correct 5 ms 256 KB Output is correct
57 Correct 5 ms 256 KB Output is correct
58 Correct 5 ms 256 KB Output is correct
59 Correct 4 ms 256 KB Output is correct
60 Correct 5 ms 256 KB Output is correct
61 Correct 5 ms 384 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 5 ms 384 KB Output is correct
64 Correct 5 ms 256 KB Output is correct
65 Correct 5 ms 256 KB Output is correct
66 Correct 5 ms 384 KB Output is correct
67 Correct 5 ms 384 KB Output is correct
68 Correct 5 ms 368 KB Output is correct
69 Correct 5 ms 256 KB Output is correct
70 Correct 5 ms 256 KB Output is correct
71 Correct 5 ms 256 KB Output is correct
72 Correct 4 ms 256 KB Output is correct
73 Correct 4 ms 256 KB Output is correct
74 Correct 5 ms 256 KB Output is correct
75 Correct 5 ms 256 KB Output is correct
76 Correct 4 ms 256 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 5 ms 256 KB Output is correct
81 Correct 5 ms 256 KB Output is correct
82 Correct 4 ms 256 KB Output is correct
83 Correct 5 ms 256 KB Output is correct
84 Correct 5 ms 288 KB Output is correct
85 Correct 4 ms 384 KB Output is correct
86 Correct 5 ms 256 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 256 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 256 KB Output is correct
93 Correct 5 ms 384 KB Output is correct
94 Correct 4 ms 384 KB Output is correct
95 Correct 4 ms 256 KB Output is correct
96 Correct 5 ms 256 KB Output is correct
97 Correct 4 ms 256 KB Output is correct
98 Incorrect 6 ms 384 KB Wrong Answer [4]
99 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 512 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -