oj.uz

Submission #1078068

# Submission time Handle Problem Language Result Execution time Memory
1078068 2024-08-27T12:12:37 Z Whisper Voting Cities (NOI22_votingcity) C++17
100 / 100
 86 ms 8664 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX_NODE                    5005
#define MAX_EDGE                    10005

struct Edge{
    int u, v, w;
    Edge(){}
    Edge(int _u, int _v, int _w): u(_u), v(_v), w(_w){}

    int other(int x){return (x ^ u ^ v);}
} edge[MAX_EDGE];

int numNode, numEdge, numCity, numQuery;
bool voting[MAX_NODE];
vector<int> G[MAX_NODE];

int minDist[MAX_NODE][MASK(5)];

void process(void){
    cin >> numNode >> numEdge >> numCity;

    for (int i = 1; i <= numCity; ++i){
        int x; cin >> x;
        voting[x] = true;
    }

    for (int i = 1; i <= numEdge; ++i){
        cin >> edge[i].u >> edge[i].v >> edge[i].w;
        G[edge[i].v].emplace_back(i);
    }
    auto new_cost = [&](int x, int t){
        assert(x % 10 == 0);
        return x - x * t / 10;
    };
    memset(minDist, 0x3f, sizeof minDist);
    #define Tu tuple<int, int, int>
    priority_queue<Tu, vector<Tu>, greater<Tu>> q;
    for (int i = 0; i < numNode; ++i) if(voting[i]) q.emplace(0, i, 0), minDist[i][0] = 0;

    while(q.size()){
        int du, u, state; tie(du, u, state) = q.top(); q.pop();

        if(du > minDist[u][state]) continue;
        for (int &i : G[u]){
            int v = edge[i].other(u);
            if(minimize(minDist[v][state], minDist[u][state] + edge[i].w)){
                q.emplace(minDist[v][state], v, state);
            }
            REP(j, 5) if(!BIT(state, j)){
                if(minimize(minDist[v][state | MASK(j)], minDist[u][state] + new_cost(edge[i].w, j + 1))){
                    q.emplace(minDist[v][state | MASK(j)], v, state | MASK(j));
                }
            }
        }
    }
    cin >> numQuery;
    for (int i = 1; i <= numQuery; ++i){
        int T[5], s;
        cin >> s >> T[0] >> T[1] >> T[2] >> T[3] >> T[4];
        REP(j, 5) if(T[j] == -1) T[j] = 1e12;

        int ans = LINF;
        for (int mask = 0; mask < MASK(5); ++mask) if(minDist[s][mask] < LINF){
            int cost = minDist[s][mask];
            for (int j = 0; j < 5; ++j) if(BIT(mask, j)){
                cost += T[j];
            }
            minimize(ans, cost);
        }

        cout << (ans >= LINF ? -1 : ans) << '\n';
    }
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 4052 KB Output is correct
2 Correct 11 ms 2136 KB Output is correct
3 Correct 44 ms 4084 KB Output is correct
4 Correct 1 ms 1624 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 4052 KB Output is correct
2 Correct 11 ms 2136 KB Output is correct
3 Correct 44 ms 4084 KB Output is correct
4 Correct 1 ms 1624 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Correct 51 ms 3936 KB Output is correct
7 Correct 12 ms 2228 KB Output is correct
8 Correct 44 ms 4052 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 1588 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 4052 KB Output is correct
2 Correct 11 ms 2136 KB Output is correct
3 Correct 44 ms 4084 KB Output is correct
4 Correct 1 ms 1624 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Correct 51 ms 3936 KB Output is correct
7 Correct 12 ms 2228 KB Output is correct
8 Correct 44 ms 4052 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 1588 KB Output is correct
11 Correct 67 ms 8652 KB Output is correct
12 Correct 15 ms 2240 KB Output is correct
13 Correct 59 ms 4116 KB Output is correct
14 Correct 1 ms 1628 KB Output is correct
15 Correct 1 ms 1628 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 4052 KB Output is correct
2 Correct 11 ms 2136 KB Output is correct
3 Correct 44 ms 4084 KB Output is correct
4 Correct 1 ms 1624 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Correct 3 ms 2396 KB Output is correct
7 Correct 17 ms 2140 KB Output is correct
8 Correct 62 ms 4056 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 4052 KB Output is correct
2 Correct 11 ms 2136 KB Output is correct
3 Correct 44 ms 4084 KB Output is correct
4 Correct 1 ms 1624 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Correct 51 ms 3936 KB Output is correct
7 Correct 12 ms 2228 KB Output is correct
8 Correct 44 ms 4052 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 1588 KB Output is correct
11 Correct 3 ms 2396 KB Output is correct
12 Correct 17 ms 2140 KB Output is correct
13 Correct 62 ms 4056 KB Output is correct
14 Correct 48 ms 4052 KB Output is correct
15 Correct 11 ms 2140 KB Output is correct
16 Correct 65 ms 4052 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 5584 KB Output is correct
2 Correct 64 ms 8620 KB Output is correct
3 Correct 31 ms 2648 KB Output is correct
4 Correct 58 ms 4048 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2328 KB Output is correct
2 Correct 4 ms 2332 KB Output is correct
3 Correct 1 ms 1628 KB Output is correct
4 Correct 3 ms 2332 KB Output is correct
5 Correct 3 ms 2332 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 3 ms 2332 KB Output is correct
8 Correct 3 ms 2332 KB Output is correct

Subtask #8
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 4052 KB Output is correct
2 Correct 11 ms 2136 KB Output is correct
3 Correct 44 ms 4084 KB Output is correct
4 Correct 1 ms 1624 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Correct 51 ms 3936 KB Output is correct
7 Correct 12 ms 2228 KB Output is correct
8 Correct 44 ms 4052 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 1588 KB Output is correct
11 Correct 67 ms 8652 KB Output is correct
12 Correct 15 ms 2240 KB Output is correct
13 Correct 59 ms 4116 KB Output is correct
14 Correct 1 ms 1628 KB Output is correct
15 Correct 1 ms 1628 KB Output is correct
16 Correct 3 ms 2396 KB Output is correct
17 Correct 17 ms 2140 KB Output is correct
18 Correct 62 ms 4056 KB Output is correct
19 Correct 48 ms 4052 KB Output is correct
20 Correct 11 ms 2140 KB Output is correct
21 Correct 65 ms 4052 KB Output is correct
22 Correct 66 ms 5584 KB Output is correct
23 Correct 64 ms 8620 KB Output is correct
24 Correct 31 ms 2648 KB Output is correct
25 Correct 58 ms 4048 KB Output is correct
26 Correct 5 ms 2328 KB Output is correct
27 Correct 4 ms 2332 KB Output is correct
28 Correct 1 ms 1628 KB Output is correct
29 Correct 3 ms 2332 KB Output is correct
30 Correct 3 ms 2332 KB Output is correct
31 Correct 1 ms 1884 KB Output is correct
32 Correct 3 ms 2332 KB Output is correct
33 Correct 3 ms 2332 KB Output is correct
34 Correct 1 ms 1628 KB Output is correct
35 Correct 1 ms 1628 KB Output is correct
36 Correct 1 ms 1624 KB Output is correct
37 Correct 66 ms 8664 KB Output is correct
38 Correct 86 ms 8644 KB Output is correct
39 Correct 50 ms 4048 KB Output is correct
40 Correct 1 ms 1628 KB Output is correct
41 Correct 3 ms 2140 KB Output is correct
42 Correct 72 ms 8544 KB Output is correct
43 Correct 71 ms 8652 KB Output is correct
44 Correct 50 ms 4056 KB Output is correct
45 Correct 27 ms 2396 KB Output is correct