#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
const long long MAXN = 205;
void speed()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
long long n, l, a[MAXN], t[MAXN];
void read()
{
cin >> n >> l;
for (long long i = 1; i <= n; ++ i)
cin >> a[i];
for (long long i = 1; i <= n; ++ i)
cin >> t[i];
}
long long p[MAXN], used[MAXN], ans = 0;
void check()
{
long long ttime = 0, on = 1, cnt = 0;
for (long long i = 1; i <= n; ++ i)
{
long long go = a[p[i]];
ttime += min(go - on, l - go + on);
if(ttime <= t[p[i]])cnt ++;
}
ans = max(ans, cnt);
}
void gen(long long pos)
{
if(pos > n)
{
check();
return;
}
for (long long i = 1; i <= n; ++ i)
{
if(!used[i])
{
used[i] = 1;
p[pos] = i;
gen(pos+1);
used[i] = 0;
}
}
}
int main()
{
speed();
read();
gen(1);
cout << ans << endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Incorrect |
12 ms |
460 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Incorrect |
12 ms |
460 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Incorrect |
12 ms |
460 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Incorrect |
12 ms |
460 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |