-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
1237.cpp
90 lines (82 loc) · 2.49 KB
/
1237.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
__________________________________________________________________________________________________
sample 0 ms submission
/*
* // This is the custom function interface.
* // You should not implement it, or speculate about its implementation
* class CustomFunction {
* public:
* // Returns f(x, y) for any given positive integers x and y.
* // Note that f(x, y) is increasing with respect to both x and y.
* // i.e. f(x, y) < f(x + 1, y), f(x, y) < f(x, y + 1)
* int f(int x, int y);
* };
*/
/*
- - - + + + +
- - - + + + +
- - - z + + +
- - - - - - -
- - - - - - -
*/
//x,y++排除
//x++,y++排除
//x++,y排除
//
class Solution {
public:
vector<vector<int>> findSolution(CustomFunction& customfunction, int z) {
vector<vector<int>> re;
int middle;
for(int x=1;x<1001;x++)
{
int left=1,right=1000;
while(left<=right)
{
middle=(left+right)/2;
if(customfunction.f(x,middle)<z)
left=(left+right)/2+1;
else if(customfunction.f(x,middle)>z)
right=middle-1;
else
{
re.push_back(vector<int>{x,middle});
break;
}
}
}
return re;
return re;
}
};
__________________________________________________________________________________________________
sample 4 ms submission
/*
* // This is the custom function interface.
* // You should not implement it, or speculate about its implementation
* class CustomFunction {
* public:
* // Returns f(x, y) for any given positive integers x and y.
* // Note that f(x, y) is increasing with respect to both x and y.
* // i.e. f(x, y) < f(x + 1, y), f(x, y) < f(x, y + 1)
* int f(int x, int y);
* };
*/
class Solution {
public:
vector<vector<int>> findSolution(CustomFunction& customfunction, int z) {
vector<vector<int>> ans;
for(int i = 1; i <= 1000; i++) {
for(int j = 1; j <= 1000; j++) {
if(customfunction.f(i, j) == z) {
vector<int> tmp(2);
tmp[0] = i;
tmp[1] = j;
ans.push_back(tmp);
} else if(customfunction.f(i, j) >= z)
break;
}
}
return ans;
}
};
__________________________________________________________________________________________________