oj.uz

Submission #602842

# Submission time Handle Problem Language Result Execution time Memory
602842 2022-07-23T11:46:05 Z Joshc Training (IOI07_training) C++11
91 / 100
 300 ms 17848 KB 
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
 
#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
 
#define pii pair<int, int>
#define mp make_pair
#define f first
#define s second
 
vector<int> edges[1005], edges2[1005];
vector<pair<pii, vector<pii>>> paths[1005]; 
vector<pair<pii, int>> unpaved;
int parent[1005], depth[1005], parity[1005], ind[1005][1005], dp[1005][1024], precalc[5005]; 
 
void dfs(int v, int p, int d, int t) {
    parent[v] = p;
    depth[v] = d;
    parity[v] = t;
    for (int i : edges2[v]) {
        if (i != p) {
            dfs(i, v, d+1, 1^t);
            edges[v].push_back(i);
        }
    }
}
 
int ans(int v, int b) {
    if (dp[v][b] != -1) return dp[v][b];
    dp[v][b] = 0;
    for (int i : edges[v]) {
        if ((b&ind[v][i]) == 0) dp[v][b] += ans(i, 0);
    }
    for (auto path : paths[v]) {
        if (b&path.s.back().s) continue;
        if (precalc[path.f.s] == -1) {
            precalc[path.f.s] = path.f.f;
            for (int i=0; i+1<path.s.size(); i++) precalc[path.f.s] += ans(path.s[i].f, path.s[i].s);
        }
        dp[v][b] = max(dp[v][b], precalc[path.f.s]+ans(v, b^path.s.back().s));
    }
    return dp[v][b];
}
 
int main() {
    int n, m, a, b, c, total = 0, pathnum = 0;
    scan(n);
    scan(m);
    while (m--) {
        scan(a);
        scan(b);
        scan(c);
        total += c;
        if (c) unpaved.push_back({{a, b}, c});
        else {
            edges2[a].push_back(b);
            edges2[b].push_back(a);
        }
    }
    dfs(1, 0, 0, 0);
    for (int i=1; i<=n; i++) {
        for (int j=0; j<edges[i].size(); j++) ind[i][edges[i][j]] = 1<<j;
    }
    for (auto i : unpaved) {
        a = i.f.f, b = i.f.s, c = i.s;
        if (parity[a] != parity[b]) continue;
        if (depth[a] < depth[b]) swap(a, b);
        vector<pii> path = {{a, 0}};
        while (depth[a] != depth[b]) {
            path.emplace_back(parent[a], ind[parent[a]][a]);
            a = parent[a];
        }
        if (a != b) {
            path.emplace_back(b, 0);
            while (parent[a] != parent[b]) {
                path.emplace_back(parent[a], ind[parent[a]][a]);
                a = parent[a];
                path.emplace_back(parent[b], ind[parent[b]][b]);
                b = parent[b];
            }
            path.emplace_back(parent[a], ind[parent[a]][a]^ind[parent[a]][b]);
            a = parent[a];
        }
        paths[a].push_back({{c, pathnum++}, path});
    }
    fill(&dp[0][0], &dp[1004][0], -1);
    fill(&precalc[0], &precalc[5004], -1);
    printf("%d\n", total-ans(1, 0));
}

Compilation message

training.cpp: In function 'int ans(int, int)':
training.cpp:41:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |             for (int i=0; i+1<path.s.size(); i++) precalc[path.f.s] += ans(path.s[i].f, path.s[i].s);
      |                           ~~~^~~~~~~~~~~~~~
training.cpp: In function 'int main()':
training.cpp:65:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |         for (int j=0; j<edges[i].size(); j++) ind[i][edges[i][j]] = 1<<j;
      |                       ~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4436 KB Output is correct
2 Correct 3 ms 4456 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4588 KB Output is correct
2 Correct 2 ms 4592 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 10656 KB Output is correct
2 Correct 11 ms 11000 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 2 ms 4436 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4436 KB Output is correct
2 Correct 2 ms 4436 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4564 KB Output is correct
2 Correct 2 ms 4592 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4860 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5320 KB Output is correct
2 Correct 4 ms 5204 KB Output is correct
3 Correct 46 ms 6100 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7124 KB Output is correct
2 Correct 33 ms 5804 KB Output is correct
3 Correct 8 ms 6228 KB Output is correct

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 4972 KB Output is correct
2 Correct 6 ms 6612 KB Output is correct
3 Execution timed out 409 ms 17848 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #11
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 9580 KB Output is correct
2 Correct 232 ms 17396 KB Output is correct
3 Correct 16 ms 9508 KB Output is correct
4 Correct 33 ms 6116 KB Output is correct