# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
872199 | 2023-11-12T13:35:16 Z | SalihSahin | Svjetlo (COCI20_svjetlo) | C++14 | 152 ms | 52952 KB |
#include<bits/stdc++.h> #define pb push_back #define mp make_pair #define int long long using namespace std; const int N = 5e5 + 5; const int mod = 1e9+7; const int inf = 1e18 + 10; const int L = 20 * 20 * 20; vector<int> in(N), adj[N]; vector<int> arr; void dfs(int node, int par){ arr.pb(node); for(auto itr: adj[node]){ if(itr != par){ dfs(itr, node); } } } int32_t main(){ ios_base::sync_with_stdio(false); cin.tie(0); int n; cin>>n; string s; cin>>s; for(int i = 0; i < n-1; i++){ int a, b; cin>>a>>b; in[a]++; in[b]++; adj[a].pb(b); adj[b].pb(a); } int uc = 0; for(int i = 1; i <= n; i++){ if(in[i] == 1){ uc = i; break; } } dfs(uc, uc); int first = n, last = 0; vector<int> tree(n); int ans = 0; for(int i = 0; i < n; i++){ tree[i] = s[arr[i] - 1] - '0'; if(tree[i] == 0){ first = min(first, i); last = max(last, i); } } vector<int> nt; for(int i = first; i <= last; i++){ nt.pb(tree[i]); } for(int i = 0; i < nt.size(); i++){ if(!nt[i]){ ans++; continue; } if(i == nt.size()-1) break; if(nt[i] == 1 && nt[i+1] == 1){ ans += 4; i++; } else if(nt[i] == 1 && nt[i+1] == 0){ nt[i+1] = 1; ans += 3; } } cout<<ans<<endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 15960 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 113 ms | 52952 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 152 ms | 45528 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 15960 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |