oj.uz

Submission #584456

# Submission time Handle Problem Language Result Execution time Memory
584456 2022-06-27T12:07:17 Z dxz05 Pinball (JOI14_pinball) C++14
11 / 100
 1 ms 324 KB 
#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
#pragma GCC target("avx2")

#include <bits/stdc++.h>

#include <random>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

#define MP make_pair

typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.000001;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 2e6 + 3e2;
const int M = 1111;

long long pinball(int m, int n, vector<int> a, vector<int> b, vector<int> c, vector<int> d) {
    set<int> positions = {1, n};
//    for (int i = 0; i < m; i++) {
//        positions.insert(a[i]);
//        positions.insert(b[i]);
//        if (a[i] > 1) positions.insert(a[i] - 1);
//        if (b[i] < n) positions.insert(b[i] + 1);
//    }

//    set<int> different;
//    for (int x : positions){
//        for (int i = 0; i < m; i++){
//            if (a[i] <= x && x <= b[i]) x = c[i];
//        }
//        different.insert(x);
//    }
//
//    if (different.size() > 1) return -1;
//
//    int final = *different.begin();

    ll cost = LLINF;
    for (int mask = 0; mask < (1 << m); mask++){
        set<int> different;
        for (int x : positions){
            for (int i = 0; i < m; i++){
                if (!(mask & (1 << i))) continue;
                if (a[i] <= x && x <= b[i]) x = c[i];
            }
            different.insert(x);
        }

        ll cur = 0;
        for (int i = 0; i < m; i++){
            if (mask & (1 << i)) cur += d[i];
        }

        if (different.size() == 1) cost = min(cost, cur);
    }

    if (cost == LLINF) cost = -1;

    return cost;
}

void solve(int TC) {
    int m, n;
    cin >> m >> n;

    vector<int> a(m), b(m), c(m), d(m);
    for (int i = 0; i < m; i++) cin >> a[i] >> b[i] >> c[i] >> d[i];

    cout << pinball(m, n, a, b, c, d) << endl;

}

int main() {
    startTime = clock();
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int TC = 1;
    //    cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

#ifdef dddxxz
    cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;
#endif

    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 1 ms 324 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 1 ms 324 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 1 ms 324 KB Output isn't correct
10 Halted 0 ms 0 KB -