| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 14100 |
2015-05-01T23:34:34 Z |
comet |
Be Two Bees (OJUZ10_b2b) |
C++ |
|
47 ms |
4208 KB |
#include<cstdio>
#include<algorithm>
typedef std::pair<double,int> pp;
#define ll long long
ll p,h[100010],t[100010];
pp s[100010];
int n;
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++)scanf("%lld",&h[i]),p+=h[i];
for(int i=0;i<n;i++)scanf("%lld",&t[i]);
for(int i=0;i<n;i++)s[i]=pp((double)(p-h[i])/(double)t[i],i);
sort(s,s+n);
printf("%d %d\n",s[0].second,s[1].second);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
4208 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
4208 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
4208 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
4208 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
4208 KB |
Output isn't correct |
| 6 |
Incorrect |
0 ms |
4208 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
4208 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
4208 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
4208 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
4208 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
4208 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
4208 KB |
Output isn't correct |
| 6 |
Incorrect |
0 ms |
4208 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
4208 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
4208 KB |
Output isn't correct |
| 9 |
Incorrect |
0 ms |
4208 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
46 ms |
4208 KB |
Output isn't correct |
| 2 |
Incorrect |
29 ms |
4208 KB |
Output isn't correct |
| 3 |
Incorrect |
35 ms |
4208 KB |
Output isn't correct |
| 4 |
Incorrect |
45 ms |
4208 KB |
Output isn't correct |
| 5 |
Incorrect |
39 ms |
4208 KB |
Output isn't correct |
| 6 |
Incorrect |
47 ms |
4208 KB |
Output isn't correct |
| 7 |
Incorrect |
7 ms |
4208 KB |
Output isn't correct |
| 8 |
Incorrect |
11 ms |
4208 KB |
Output isn't correct |
| 9 |
Incorrect |
43 ms |
4208 KB |
Output isn't correct |
| 10 |
Incorrect |
27 ms |
4208 KB |
Output isn't correct |
| 11 |
Incorrect |
29 ms |
4208 KB |
Output isn't correct |
| 12 |
Incorrect |
31 ms |
4208 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
40 ms |
4208 KB |
Output isn't correct |
| 2 |
Incorrect |
28 ms |
4208 KB |
Output isn't correct |
| 3 |
Incorrect |
23 ms |
4208 KB |
Output isn't correct |
| 4 |
Incorrect |
34 ms |
4208 KB |
Output isn't correct |
| 5 |
Incorrect |
31 ms |
4208 KB |
Output isn't correct |
| 6 |
Incorrect |
41 ms |
4208 KB |
Output isn't correct |
| 7 |
Incorrect |
43 ms |
4208 KB |
Output isn't correct |
| 8 |
Incorrect |
42 ms |
4208 KB |
Output isn't correct |
| 9 |
Incorrect |
32 ms |
4208 KB |
Output isn't correct |
| 10 |
Incorrect |
5 ms |
4208 KB |
Output isn't correct |
| 11 |
Incorrect |
37 ms |
4208 KB |
Output isn't correct |
| 12 |
Incorrect |
44 ms |
4208 KB |
Output isn't correct |
| 13 |
Incorrect |
31 ms |
4208 KB |
Output isn't correct |
| 14 |
Incorrect |
46 ms |
4208 KB |
Output isn't correct |
| 15 |
Incorrect |
37 ms |
4208 KB |
Output isn't correct |
| 16 |
Incorrect |
40 ms |
4208 KB |
Output isn't correct |
| 17 |
Incorrect |
42 ms |
4208 KB |
Output isn't correct |
