oj.uz

Submission #367235

# Submission time Handle Problem Language Result Execution time Memory
367235 2021-02-16T16:46:23 Z piddddgy Collecting Stamps 3 (JOI20_ho_t3) C++11
5 / 100
 81 ms 18412 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define cerr if(false) cerr
#define watch(x) cerr << (#x) << " is " << (x) << endl;
#define endl '\n'
#define ld long double
#define int long long
#define pii pair<int, int>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all(x) (x).begin(), (x).end()

const int maxn = 15;

bool vis[5000][maxn][300];

int n, l;
int x[maxn], t[maxn];

int bits(int num) {
    int res = 0;
    for(int i = 0; i < 30; i++) {
        if(num & (1LL << i)) res++;
    }

    return res;
}
int ans = 0;
void dfs(int mask, int cur, int time) {
    if(vis[mask][cur][time]) return;
    vis[mask][cur][time] = true;
    ans = max(ans, bits(mask));
    cerr << "on " << cur << " with " << time << endl;
    for(int i = 0; i < n; i++) {
        if((1 << i) & mask) continue;

        int dis = abs(x[cur]- x[i]);
        dis = min(dis, l-dis);

        if(time+dis <= t[i]) {
            dfs(mask | (1 << i), i, time+dis);
        }
    }
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> l;
    for(int i = 0; i < n; i++) {
        cin >> x[i];
    }

    for(int i = 0; i < n; i++) {
        cin >> t[i];
    }

    for(int i = 0; i < n; i++) {
        int dis = min(x[i], l-x[i]);

        if(dis <= t[i]) {
            dfs(1 << i, i, dis);
        } else {
            dfs(0, i, dis);
        }
    }

    cout << ans << endl;
}

/*

[bitmask][current][time] 

9 600 000

6 25
3 4 7 17 21 23
11 7 17 10 8 10
-> 4

5 20
4 5 8 13 17
18 23 15 7 10
-> 5

Did you read the bounds?
Did you make typos?
Are there edge cases (N=1?)
Are array sizes proper?
Integer overflow?
DS reset properly between test cases?
Is using long longs causing TLE?
Are you using floating points?
*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 876 KB Output is correct
6 Correct 2 ms 2412 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 1260 KB Output is correct
9 Correct 2 ms 1644 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 18 ms 18028 KB Output is correct
13 Correct 6 ms 5356 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 38 ms 13420 KB Output is correct
17 Correct 81 ms 18412 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 876 KB Output is correct
6 Correct 2 ms 2412 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 1260 KB Output is correct
9 Correct 2 ms 1644 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 18 ms 18028 KB Output is correct
13 Correct 6 ms 5356 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 38 ms 13420 KB Output is correct
17 Correct 81 ms 18412 KB Output is correct
18 Runtime error 2 ms 492 KB Execution killed with signal 11
19 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 876 KB Output is correct
6 Correct 2 ms 2412 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 1260 KB Output is correct
9 Correct 2 ms 1644 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 18 ms 18028 KB Output is correct
13 Correct 6 ms 5356 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 38 ms 13420 KB Output is correct
17 Correct 81 ms 18412 KB Output is correct
18 Runtime error 3 ms 620 KB Execution killed with signal 11
19 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 876 KB Output is correct
6 Correct 2 ms 2412 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 1260 KB Output is correct
9 Correct 2 ms 1644 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 18 ms 18028 KB Output is correct
13 Correct 6 ms 5356 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 38 ms 13420 KB Output is correct
17 Correct 81 ms 18412 KB Output is correct
18 Runtime error 2 ms 492 KB Execution killed with signal 11
19 Halted 0 ms 0 KB -