# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
550935 |
2022-04-19T12:15:55 Z |
Zhora_004 |
Graph (BOI20_graph) |
C++17 |
|
4 ms |
340 KB |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <string>
#include <sstream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <stack>
#include <cstdio>
#include <climits>
#include <tuple>
#include <ctime>
#include <cstring>
#include <numeric>
#include <functional>
#include <chrono>
#include <cassert>
#include <bitset>
#include <fstream>
//#include <bit>
//#include <ranges>
//#include <numbers>
#define itn int
#define sacnf scanf
#define sz(a) ((int)((a).size()))
// printf("%.10f\n", ans);
/*ofstream fout("timeline.out");
ifstream fin("timeline.in");*/
using ll = long long;
using namespace std;
const ll mod = 1e9 + 7;
const int limit = 150;
const int N = 2e5 + 1, inf = 1e9;
struct Edge {
int v, w;
};
int n, m, a;
vector<bool> vis;
vector<int> comp, ans;
vector<vector<Edge>> gp;
void dfs1(int u)
{
vis[u] = 1;
comp.push_back(u);
if (a == -1 || sz(gp[u]) > sz(gp[a])) a = u;
for (Edge& e : gp[u]) if (!vis[e.v]) dfs1(e.v);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
vis = vector<bool>(n);
ans = vector<int>(n);
gp = vector<vector<Edge>>(n);
for (int i = 0; i < m; i++)
{
int u, v, w;
cin >> u >> v >> w;
gp[--u].push_back({ --v, w * 2 });
gp[v].push_back({ u, w * 2 });
}
for (int i = 0; i < n; i++)
{
if (!vis[i])
{
a = -1;
comp.clear();
dfs1(i);
int mn = inf, num = inf;
for (int val = 0; val <= limit; val++)
{
for (int& u : comp) vis[u] = 0;
queue<int> q;
q.push(a);
vis[a] = 1;
ans[a] = val;
int sum = abs(val);
while (!q.empty())
{
int u = q.front();
q.pop();
for (Edge& e : gp[u])
{
int v = e.v, w = e.w;
if (!vis[v])
{
vis[v] = 1;
ans[v] = w - ans[u];
q.push(v);
if (ans[v] < -limit || ans[v] > limit)
{
sum = inf;
break;
}
sum += abs(ans[v]);
}
else if (ans[u] + ans[v] != w)
{
sum = inf;
break;
}
}
if (sum == inf) break;
}
if (sum < mn) mn = sum, num = val;
}
if (num == inf) return cout << "NO", 0;
for (int& u : comp) vis[u] = 0;
queue<int> q;
q.push(a);
vis[a] = 1;
ans[a] = num;
while (!q.empty())
{
int u = q.front();
q.pop();
for (Edge& e : gp[u])
{
int v = e.v, w = e.w;
if (!vis[v])
{
vis[v] = 1;
ans[v] = w - ans[u];
q.push(v);
}
}
}
}
}
cout << "YES\n";
for (int& i : ans)
{
if (i == -1) cout << "-0.5";
else
{
cout << i / 2;
if (abs(i) & 1) cout << ".5";
}
cout << " ";
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
answer = YES |
2 |
Correct |
1 ms |
340 KB |
answer = YES |
3 |
Correct |
1 ms |
212 KB |
answer = YES |
4 |
Correct |
1 ms |
316 KB |
answer = NO |
5 |
Correct |
0 ms |
212 KB |
answer = YES |
6 |
Correct |
1 ms |
212 KB |
answer = YES |
7 |
Correct |
1 ms |
212 KB |
answer = YES |
8 |
Correct |
1 ms |
320 KB |
answer = YES |
9 |
Correct |
1 ms |
320 KB |
answer = NO |
10 |
Correct |
1 ms |
324 KB |
answer = YES |
11 |
Correct |
1 ms |
212 KB |
answer = YES |
12 |
Correct |
1 ms |
316 KB |
answer = NO |
13 |
Correct |
1 ms |
324 KB |
answer = YES |
14 |
Correct |
1 ms |
212 KB |
answer = YES |
15 |
Correct |
1 ms |
212 KB |
answer = YES |
16 |
Correct |
0 ms |
212 KB |
answer = YES |
17 |
Correct |
0 ms |
212 KB |
answer = YES |
18 |
Correct |
1 ms |
212 KB |
answer = YES |
19 |
Correct |
0 ms |
212 KB |
answer = YES |
20 |
Correct |
0 ms |
320 KB |
answer = YES |
21 |
Correct |
0 ms |
212 KB |
answer = YES |
22 |
Correct |
1 ms |
320 KB |
answer = NO |
23 |
Correct |
0 ms |
212 KB |
answer = NO |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
answer = YES |
2 |
Correct |
1 ms |
340 KB |
answer = YES |
3 |
Correct |
1 ms |
212 KB |
answer = YES |
4 |
Correct |
1 ms |
316 KB |
answer = NO |
5 |
Correct |
0 ms |
212 KB |
answer = YES |
6 |
Correct |
1 ms |
212 KB |
answer = YES |
7 |
Correct |
1 ms |
212 KB |
answer = YES |
8 |
Correct |
1 ms |
320 KB |
answer = YES |
9 |
Correct |
1 ms |
320 KB |
answer = NO |
10 |
Correct |
1 ms |
324 KB |
answer = YES |
11 |
Correct |
1 ms |
212 KB |
answer = YES |
12 |
Correct |
1 ms |
316 KB |
answer = NO |
13 |
Correct |
1 ms |
324 KB |
answer = YES |
14 |
Correct |
1 ms |
212 KB |
answer = YES |
15 |
Correct |
1 ms |
212 KB |
answer = YES |
16 |
Correct |
0 ms |
212 KB |
answer = YES |
17 |
Correct |
0 ms |
212 KB |
answer = YES |
18 |
Correct |
1 ms |
212 KB |
answer = YES |
19 |
Correct |
0 ms |
212 KB |
answer = YES |
20 |
Correct |
0 ms |
320 KB |
answer = YES |
21 |
Correct |
0 ms |
212 KB |
answer = YES |
22 |
Correct |
1 ms |
320 KB |
answer = NO |
23 |
Correct |
0 ms |
212 KB |
answer = NO |
24 |
Correct |
2 ms |
320 KB |
answer = YES |
25 |
Correct |
1 ms |
320 KB |
answer = YES |
26 |
Correct |
1 ms |
212 KB |
answer = YES |
27 |
Correct |
1 ms |
212 KB |
answer = YES |
28 |
Correct |
1 ms |
212 KB |
answer = YES |
29 |
Correct |
1 ms |
212 KB |
answer = YES |
30 |
Correct |
1 ms |
212 KB |
answer = NO |
31 |
Correct |
1 ms |
320 KB |
answer = YES |
32 |
Correct |
1 ms |
212 KB |
answer = YES |
33 |
Correct |
2 ms |
212 KB |
answer = YES |
34 |
Correct |
1 ms |
212 KB |
answer = YES |
35 |
Correct |
1 ms |
212 KB |
answer = YES |
36 |
Correct |
1 ms |
212 KB |
answer = YES |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
answer = YES |
2 |
Correct |
1 ms |
340 KB |
answer = YES |
3 |
Correct |
1 ms |
212 KB |
answer = YES |
4 |
Correct |
1 ms |
316 KB |
answer = NO |
5 |
Correct |
0 ms |
212 KB |
answer = YES |
6 |
Correct |
1 ms |
212 KB |
answer = YES |
7 |
Correct |
1 ms |
212 KB |
answer = YES |
8 |
Correct |
1 ms |
320 KB |
answer = YES |
9 |
Correct |
1 ms |
320 KB |
answer = NO |
10 |
Correct |
1 ms |
324 KB |
answer = YES |
11 |
Correct |
1 ms |
212 KB |
answer = YES |
12 |
Correct |
1 ms |
316 KB |
answer = NO |
13 |
Correct |
1 ms |
324 KB |
answer = YES |
14 |
Correct |
1 ms |
212 KB |
answer = YES |
15 |
Correct |
1 ms |
212 KB |
answer = YES |
16 |
Correct |
0 ms |
212 KB |
answer = YES |
17 |
Correct |
0 ms |
212 KB |
answer = YES |
18 |
Correct |
1 ms |
212 KB |
answer = YES |
19 |
Correct |
0 ms |
212 KB |
answer = YES |
20 |
Correct |
0 ms |
320 KB |
answer = YES |
21 |
Correct |
0 ms |
212 KB |
answer = YES |
22 |
Correct |
1 ms |
320 KB |
answer = NO |
23 |
Correct |
0 ms |
212 KB |
answer = NO |
24 |
Correct |
2 ms |
320 KB |
answer = YES |
25 |
Correct |
1 ms |
320 KB |
answer = YES |
26 |
Correct |
1 ms |
212 KB |
answer = YES |
27 |
Correct |
1 ms |
212 KB |
answer = YES |
28 |
Correct |
1 ms |
212 KB |
answer = YES |
29 |
Correct |
1 ms |
212 KB |
answer = YES |
30 |
Correct |
1 ms |
212 KB |
answer = NO |
31 |
Correct |
1 ms |
320 KB |
answer = YES |
32 |
Correct |
1 ms |
212 KB |
answer = YES |
33 |
Correct |
2 ms |
212 KB |
answer = YES |
34 |
Correct |
1 ms |
212 KB |
answer = YES |
35 |
Correct |
1 ms |
212 KB |
answer = YES |
36 |
Correct |
1 ms |
212 KB |
answer = YES |
37 |
Correct |
1 ms |
212 KB |
answer = YES |
38 |
Correct |
1 ms |
212 KB |
answer = YES |
39 |
Correct |
2 ms |
340 KB |
answer = YES |
40 |
Correct |
2 ms |
340 KB |
answer = YES |
41 |
Correct |
1 ms |
340 KB |
answer = NO |
42 |
Incorrect |
4 ms |
340 KB |
participant answer is larger than the answer of jury |
43 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
answer = YES |
2 |
Correct |
1 ms |
340 KB |
answer = YES |
3 |
Correct |
1 ms |
212 KB |
answer = YES |
4 |
Correct |
1 ms |
316 KB |
answer = NO |
5 |
Correct |
0 ms |
212 KB |
answer = YES |
6 |
Correct |
1 ms |
212 KB |
answer = YES |
7 |
Correct |
1 ms |
212 KB |
answer = YES |
8 |
Correct |
1 ms |
320 KB |
answer = YES |
9 |
Correct |
1 ms |
320 KB |
answer = NO |
10 |
Correct |
1 ms |
324 KB |
answer = YES |
11 |
Correct |
1 ms |
212 KB |
answer = YES |
12 |
Correct |
1 ms |
316 KB |
answer = NO |
13 |
Correct |
1 ms |
324 KB |
answer = YES |
14 |
Correct |
1 ms |
212 KB |
answer = YES |
15 |
Correct |
1 ms |
212 KB |
answer = YES |
16 |
Correct |
0 ms |
212 KB |
answer = YES |
17 |
Correct |
0 ms |
212 KB |
answer = YES |
18 |
Correct |
1 ms |
212 KB |
answer = YES |
19 |
Correct |
0 ms |
212 KB |
answer = YES |
20 |
Correct |
0 ms |
320 KB |
answer = YES |
21 |
Correct |
0 ms |
212 KB |
answer = YES |
22 |
Correct |
1 ms |
320 KB |
answer = NO |
23 |
Correct |
0 ms |
212 KB |
answer = NO |
24 |
Correct |
2 ms |
320 KB |
answer = YES |
25 |
Correct |
1 ms |
320 KB |
answer = YES |
26 |
Correct |
1 ms |
212 KB |
answer = YES |
27 |
Correct |
1 ms |
212 KB |
answer = YES |
28 |
Correct |
1 ms |
212 KB |
answer = YES |
29 |
Correct |
1 ms |
212 KB |
answer = YES |
30 |
Correct |
1 ms |
212 KB |
answer = NO |
31 |
Correct |
1 ms |
320 KB |
answer = YES |
32 |
Correct |
1 ms |
212 KB |
answer = YES |
33 |
Correct |
2 ms |
212 KB |
answer = YES |
34 |
Correct |
1 ms |
212 KB |
answer = YES |
35 |
Correct |
1 ms |
212 KB |
answer = YES |
36 |
Correct |
1 ms |
212 KB |
answer = YES |
37 |
Correct |
1 ms |
212 KB |
answer = YES |
38 |
Correct |
1 ms |
212 KB |
answer = YES |
39 |
Correct |
2 ms |
340 KB |
answer = YES |
40 |
Correct |
2 ms |
340 KB |
answer = YES |
41 |
Correct |
1 ms |
340 KB |
answer = NO |
42 |
Incorrect |
4 ms |
340 KB |
participant answer is larger than the answer of jury |
43 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
answer = YES |
2 |
Correct |
1 ms |
340 KB |
answer = YES |
3 |
Correct |
1 ms |
212 KB |
answer = YES |
4 |
Correct |
1 ms |
316 KB |
answer = NO |
5 |
Correct |
0 ms |
212 KB |
answer = YES |
6 |
Correct |
1 ms |
212 KB |
answer = YES |
7 |
Correct |
1 ms |
212 KB |
answer = YES |
8 |
Correct |
1 ms |
320 KB |
answer = YES |
9 |
Correct |
1 ms |
320 KB |
answer = NO |
10 |
Correct |
1 ms |
324 KB |
answer = YES |
11 |
Correct |
1 ms |
212 KB |
answer = YES |
12 |
Correct |
1 ms |
316 KB |
answer = NO |
13 |
Correct |
1 ms |
324 KB |
answer = YES |
14 |
Correct |
1 ms |
212 KB |
answer = YES |
15 |
Correct |
1 ms |
212 KB |
answer = YES |
16 |
Correct |
0 ms |
212 KB |
answer = YES |
17 |
Correct |
0 ms |
212 KB |
answer = YES |
18 |
Correct |
1 ms |
212 KB |
answer = YES |
19 |
Correct |
0 ms |
212 KB |
answer = YES |
20 |
Correct |
0 ms |
320 KB |
answer = YES |
21 |
Correct |
0 ms |
212 KB |
answer = YES |
22 |
Correct |
1 ms |
320 KB |
answer = NO |
23 |
Correct |
0 ms |
212 KB |
answer = NO |
24 |
Correct |
2 ms |
320 KB |
answer = YES |
25 |
Correct |
1 ms |
320 KB |
answer = YES |
26 |
Correct |
1 ms |
212 KB |
answer = YES |
27 |
Correct |
1 ms |
212 KB |
answer = YES |
28 |
Correct |
1 ms |
212 KB |
answer = YES |
29 |
Correct |
1 ms |
212 KB |
answer = YES |
30 |
Correct |
1 ms |
212 KB |
answer = NO |
31 |
Correct |
1 ms |
320 KB |
answer = YES |
32 |
Correct |
1 ms |
212 KB |
answer = YES |
33 |
Correct |
2 ms |
212 KB |
answer = YES |
34 |
Correct |
1 ms |
212 KB |
answer = YES |
35 |
Correct |
1 ms |
212 KB |
answer = YES |
36 |
Correct |
1 ms |
212 KB |
answer = YES |
37 |
Correct |
1 ms |
212 KB |
answer = YES |
38 |
Correct |
1 ms |
212 KB |
answer = YES |
39 |
Correct |
2 ms |
340 KB |
answer = YES |
40 |
Correct |
2 ms |
340 KB |
answer = YES |
41 |
Correct |
1 ms |
340 KB |
answer = NO |
42 |
Incorrect |
4 ms |
340 KB |
participant answer is larger than the answer of jury |
43 |
Halted |
0 ms |
0 KB |
- |