oj.uz

Submission #1078065

# Submission time Handle Problem Language Result Execution time Memory
1078065 2024-08-27T12:11:45 Z Whisper Voting Cities (NOI22_votingcity) C++17
20 / 100
 59 ms 5572 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 << '\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 47 ms 4052 KB Output is correct
2 Correct 11 ms 2140 KB Output is correct
3 Correct 42 ms 3960 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 4052 KB Output is correct
2 Correct 11 ms 2140 KB Output is correct
3 Correct 42 ms 3960 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Incorrect 43 ms 4052 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 4052 KB Output is correct
2 Correct 11 ms 2140 KB Output is correct
3 Correct 42 ms 3960 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Incorrect 43 ms 4052 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 4052 KB Output is correct
2 Correct 11 ms 2140 KB Output is correct
3 Correct 42 ms 3960 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Incorrect 5 ms 2392 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 4052 KB Output is correct
2 Correct 11 ms 2140 KB Output is correct
3 Correct 42 ms 3960 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Incorrect 43 ms 4052 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 59 ms 5572 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2328 KB Output is correct
2 Correct 3 ms 2328 KB Output is correct
3 Correct 2 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 1712 KB Output is correct
7 Correct 3 ms 2332 KB Output is correct
8 Correct 3 ms 2332 KB Output is correct

Subtask #8
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 4052 KB Output is correct
2 Correct 11 ms 2140 KB Output is correct
3 Correct 42 ms 3960 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Incorrect 43 ms 4052 KB Output isn't correct
7 Halted 0 ms 0 KB -