# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
937887 |
2024-03-04T16:03:35 Z |
danikoynov |
Teams (IOI15_teams) |
C++14 |
|
4000 ms |
18444 KB |
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
struct segment
{
int l, r;
segment(int _l = 0, int _r = 0)
{
l = _l;
r = _r;
}
};
const int maxn = 5e5 + 10;
int n;
segment s[maxn];
void init(int N, int A[], int B[])
{
n = N;
for (int i = 1; i <= n; i ++)
{
s[i] = segment(A[i - 1], B[i - 1]);
}
}
int zeta(int a, int b)
{
int cnt = 0;
for (int i = 1; i <= n; i ++)
{
if (s[i].l <= a && s[i].r >= a)
continue;
if (s[i].l <= b && s[i].r >= b)
cnt ++;
}
return cnt;
}
int dp[maxn];
int can(int M, int K[])
{
for (int i = 0; i < M; i ++)
{
dp[i] = zeta(0, K[i]) - K[i];
for (int j = 0; j < i; j ++)
{
dp[i] = min(dp[i], dp[j] + zeta(K[j], K[i]) - K[i]);
}
if (dp[i] < 0)
return 0;
}
return 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
5976 KB |
Output is correct |
2 |
Correct |
2 ms |
5980 KB |
Output is correct |
3 |
Correct |
2 ms |
5980 KB |
Output is correct |
4 |
Correct |
2 ms |
6072 KB |
Output is correct |
5 |
Correct |
2 ms |
5980 KB |
Output is correct |
6 |
Correct |
2 ms |
5980 KB |
Output is correct |
7 |
Correct |
4 ms |
6132 KB |
Output is correct |
8 |
Correct |
2 ms |
5976 KB |
Output is correct |
9 |
Correct |
3 ms |
5980 KB |
Output is correct |
10 |
Correct |
2 ms |
5980 KB |
Output is correct |
11 |
Correct |
2 ms |
5980 KB |
Output is correct |
12 |
Incorrect |
11 ms |
6140 KB |
Output isn't correct |
13 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
8056 KB |
Output is correct |
2 |
Correct |
8 ms |
8064 KB |
Output is correct |
3 |
Correct |
8 ms |
8420 KB |
Output is correct |
4 |
Correct |
7 ms |
8540 KB |
Output is correct |
5 |
Execution timed out |
4075 ms |
7656 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
206 ms |
8784 KB |
Output is correct |
2 |
Correct |
223 ms |
8788 KB |
Output is correct |
3 |
Execution timed out |
4056 ms |
9016 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
818 ms |
18340 KB |
Output is correct |
2 |
Correct |
949 ms |
18444 KB |
Output is correct |
3 |
Execution timed out |
4034 ms |
17140 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |