# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
466688 |
2021-08-20T07:55:13 Z |
Em1L |
Fountain (eJOI20_fountain) |
C++14 |
|
1500 ms |
3120 KB |
#include <bits/stdc++.h>
using namespace std;
void fastIO() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }
int main()
{
fastIO();
int n, q, vol, pos;
cin >> n >> q;
vector < pair <int, int> > v(n);
vector < int > pour(n);
for (int i = 0; i < n; i++) cin >> v[i].first >> v[i].second;
for (int i = 0; i < n; i++)
for (int j = i; j <= n; j++)
{
if (j == n)
{
pour[i] = -1;
break;
}
pour[i] = j;
if (v[i].first < v[j].first) break;
}
for (int i = 0; i < q; i++)
{
cin >> pos >> vol; pos--;
while (pos != -1)
{
vol -= v[pos].second;
if (vol <= 0) break;
pos = pour[pos];
}
cout << pos + 1 << '\n';
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
3 ms |
332 KB |
Output is correct |
6 |
Correct |
2 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1565 ms |
3120 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
3 ms |
332 KB |
Output is correct |
6 |
Correct |
2 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Execution timed out |
1565 ms |
3120 KB |
Time limit exceeded |
9 |
Halted |
0 ms |
0 KB |
- |