Submission #632131

#	Time	Username	Problem	Language	Result	Execution time	Memory
632131		MohamedFaresNebili	Training (IOI07_training)	C++14	7 / 100	2 ms	544 KiB

training

#include <bits/stdc++.h>

            using namespace std;

            using ll = long long;
            using ld = long double;

            #define ff first
            #define ss second
            #define pb push_back
            #define all(x) (x).begin(), (x).end()
            #define lb lower_bound
            #define int ll

            int N, M, D[1001];
            vector<int> adj[1001];
            vector<array<int, 3>> G;
            void dfs(int v, int p) {
                D[v] = D[p] + 1;
                for(auto u : adj[v]) {
                    if(u == p) continue;
                    dfs(u, v);
                }
            }

            int32_t main() {
                ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
                cin >> N >> M;
                for(int l = 0; l < M; l++) {
                    int U, V, C; cin >> U >> V >> C;
                    if(C == 0)
                        adj[U].push_back(V),
                        adj[V].push_back(U);
                    if(C >= 1) G.push_back({U, V, C});
                }
                int res = 0, src = 0;
                for(int l = 1; l <= N; l++) {
                    if(adj[l].size() == 1) src = l;
                }
                D[src] = -1; dfs(src, src);
                for(auto e : G) {
                    int U = e[0], V = e[1], C = e[2];
                    if(abs(D[V] - D[U]) & 1)
                        res += C;
                }
                cout << res << "\n";
                return 0;
            }

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 7 / 7
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 9