# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
726050 |
2023-04-18T11:28:26 Z |
Johann |
Graph (BOI20_graph) |
C++14 |
|
700 ms |
324 KB |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
int N, M;
vvpii adj;
vi vis;
vpii poly;
vi newNodes;
vector<int> ans;
bool possible = true;
bool xdefined = false;
int x = 0;
void dfs(int v)
{
vis[v] = true;
newNodes.push_back(v);
int u, c;
for (pii e : adj[v])
{
tie(u, c) = e;
if (vis[u])
{
// check whether cohrerent possible
pii res = {poly[v].first + poly[u].first, poly[v].second + poly[u].second};
if (res.first == c && res.second == 0)
{
// perfect, nothing to do
}
else if (xdefined)
{
if (res.first + res.second * x - c != 0)
possible = false;
}
else
{
// not x defined
if (res.second == 0)
possible = false;
else
{
xdefined = true;
assert((c - res.first) % res.second == 0);
x = (c - res.first) / res.second;
}
}
}
else
{ // new Node
poly[u] = {c - poly[v].first, -poly[v].second};
dfs(u);
}
}
}
ll eval(int xcand)
{
ll tmpAns = 0;
for (int u : newNodes)
tmpAns += (ll)abs(poly[u].first + poly[u].second * xcand);
return tmpAns;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> M;
adj.resize(N);
for (int i = 0, a, b, c; i < M; ++i)
{
cin >> a >> b >> c;
--a, --b, c *= 2;
adj[a].push_back({b, c}), adj[b].push_back({a, c});
}
vis.assign(N, false);
ans.resize(N);
poly.resize(N);
for (int v = 0; v < N; ++v)
if (!vis[v])
{
xdefined = false;
x = 0;
poly[v] = {0, 1};
newNodes.clear();
dfs(v);
if (!xdefined)
{
int l = 0, r = 0;
for (int w : newNodes)
{
if (poly[w].second != 0)
{
int xcand = -poly[w].first / poly[w].second;
l = min(l, xcand), r = max(r, xcand);
}
}
while (l < r)
{
int m = (l + r) / 2;
ll e1 = eval(m);
ll e2 = eval(m + 1);
if (e1 < e2)
r = m;
else if (e1 > e2)
l = m + 1;
else
l = m, r = m;
}
x = l;
}
for (int u : newNodes)
ans[u] = poly[u].first + poly[u].second * x;
}
if (possible)
{
cout << "YES\n";
for (int v = 0; v < N; ++v)
cout << ans[v] / (double)2 << " ";
cout << "\n";
}
else
{
cout << "NO\n";
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
answer = YES |
2 |
Correct |
1 ms |
212 KB |
answer = YES |
3 |
Correct |
1 ms |
212 KB |
answer = YES |
4 |
Correct |
0 ms |
320 KB |
answer = NO |
5 |
Correct |
1 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 |
212 KB |
answer = YES |
9 |
Correct |
1 ms |
212 KB |
answer = NO |
10 |
Correct |
1 ms |
212 KB |
answer = YES |
11 |
Correct |
1 ms |
320 KB |
answer = YES |
12 |
Correct |
1 ms |
212 KB |
answer = NO |
13 |
Correct |
0 ms |
312 KB |
answer = YES |
14 |
Correct |
1 ms |
212 KB |
answer = YES |
15 |
Correct |
1 ms |
212 KB |
answer = YES |
16 |
Correct |
1 ms |
212 KB |
answer = YES |
17 |
Correct |
1 ms |
212 KB |
answer = YES |
18 |
Correct |
0 ms |
320 KB |
answer = YES |
19 |
Correct |
1 ms |
212 KB |
answer = YES |
20 |
Correct |
1 ms |
320 KB |
answer = YES |
21 |
Correct |
1 ms |
212 KB |
answer = YES |
22 |
Correct |
1 ms |
320 KB |
answer = NO |
23 |
Correct |
1 ms |
320 KB |
answer = NO |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
answer = YES |
2 |
Correct |
1 ms |
212 KB |
answer = YES |
3 |
Correct |
1 ms |
212 KB |
answer = YES |
4 |
Correct |
0 ms |
320 KB |
answer = NO |
5 |
Correct |
1 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 |
212 KB |
answer = YES |
9 |
Correct |
1 ms |
212 KB |
answer = NO |
10 |
Correct |
1 ms |
212 KB |
answer = YES |
11 |
Correct |
1 ms |
320 KB |
answer = YES |
12 |
Correct |
1 ms |
212 KB |
answer = NO |
13 |
Correct |
0 ms |
312 KB |
answer = YES |
14 |
Correct |
1 ms |
212 KB |
answer = YES |
15 |
Correct |
1 ms |
212 KB |
answer = YES |
16 |
Correct |
1 ms |
212 KB |
answer = YES |
17 |
Correct |
1 ms |
212 KB |
answer = YES |
18 |
Correct |
0 ms |
320 KB |
answer = YES |
19 |
Correct |
1 ms |
212 KB |
answer = YES |
20 |
Correct |
1 ms |
320 KB |
answer = YES |
21 |
Correct |
1 ms |
212 KB |
answer = YES |
22 |
Correct |
1 ms |
320 KB |
answer = NO |
23 |
Correct |
1 ms |
320 KB |
answer = NO |
24 |
Correct |
1 ms |
212 KB |
answer = YES |
25 |
Correct |
1 ms |
212 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 |
212 KB |
answer = YES |
32 |
Correct |
1 ms |
212 KB |
answer = YES |
33 |
Correct |
1 ms |
212 KB |
answer = YES |
34 |
Correct |
1 ms |
324 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 |
212 KB |
answer = YES |
3 |
Correct |
1 ms |
212 KB |
answer = YES |
4 |
Correct |
0 ms |
320 KB |
answer = NO |
5 |
Correct |
1 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 |
212 KB |
answer = YES |
9 |
Correct |
1 ms |
212 KB |
answer = NO |
10 |
Correct |
1 ms |
212 KB |
answer = YES |
11 |
Correct |
1 ms |
320 KB |
answer = YES |
12 |
Correct |
1 ms |
212 KB |
answer = NO |
13 |
Correct |
0 ms |
312 KB |
answer = YES |
14 |
Correct |
1 ms |
212 KB |
answer = YES |
15 |
Correct |
1 ms |
212 KB |
answer = YES |
16 |
Correct |
1 ms |
212 KB |
answer = YES |
17 |
Correct |
1 ms |
212 KB |
answer = YES |
18 |
Correct |
0 ms |
320 KB |
answer = YES |
19 |
Correct |
1 ms |
212 KB |
answer = YES |
20 |
Correct |
1 ms |
320 KB |
answer = YES |
21 |
Correct |
1 ms |
212 KB |
answer = YES |
22 |
Correct |
1 ms |
320 KB |
answer = NO |
23 |
Correct |
1 ms |
320 KB |
answer = NO |
24 |
Correct |
1 ms |
212 KB |
answer = YES |
25 |
Correct |
1 ms |
212 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 |
212 KB |
answer = YES |
32 |
Correct |
1 ms |
212 KB |
answer = YES |
33 |
Correct |
1 ms |
212 KB |
answer = YES |
34 |
Correct |
1 ms |
324 KB |
answer = YES |
35 |
Correct |
1 ms |
212 KB |
answer = YES |
36 |
Correct |
1 ms |
212 KB |
answer = YES |
37 |
Execution timed out |
1059 ms |
212 KB |
Time limit exceeded |
38 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
answer = YES |
2 |
Correct |
1 ms |
212 KB |
answer = YES |
3 |
Correct |
1 ms |
212 KB |
answer = YES |
4 |
Correct |
0 ms |
320 KB |
answer = NO |
5 |
Correct |
1 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 |
212 KB |
answer = YES |
9 |
Correct |
1 ms |
212 KB |
answer = NO |
10 |
Correct |
1 ms |
212 KB |
answer = YES |
11 |
Correct |
1 ms |
320 KB |
answer = YES |
12 |
Correct |
1 ms |
212 KB |
answer = NO |
13 |
Correct |
0 ms |
312 KB |
answer = YES |
14 |
Correct |
1 ms |
212 KB |
answer = YES |
15 |
Correct |
1 ms |
212 KB |
answer = YES |
16 |
Correct |
1 ms |
212 KB |
answer = YES |
17 |
Correct |
1 ms |
212 KB |
answer = YES |
18 |
Correct |
0 ms |
320 KB |
answer = YES |
19 |
Correct |
1 ms |
212 KB |
answer = YES |
20 |
Correct |
1 ms |
320 KB |
answer = YES |
21 |
Correct |
1 ms |
212 KB |
answer = YES |
22 |
Correct |
1 ms |
320 KB |
answer = NO |
23 |
Correct |
1 ms |
320 KB |
answer = NO |
24 |
Correct |
1 ms |
212 KB |
answer = YES |
25 |
Correct |
1 ms |
212 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 |
212 KB |
answer = YES |
32 |
Correct |
1 ms |
212 KB |
answer = YES |
33 |
Correct |
1 ms |
212 KB |
answer = YES |
34 |
Correct |
1 ms |
324 KB |
answer = YES |
35 |
Correct |
1 ms |
212 KB |
answer = YES |
36 |
Correct |
1 ms |
212 KB |
answer = YES |
37 |
Execution timed out |
1059 ms |
212 KB |
Time limit exceeded |
38 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
answer = YES |
2 |
Correct |
1 ms |
212 KB |
answer = YES |
3 |
Correct |
1 ms |
212 KB |
answer = YES |
4 |
Correct |
0 ms |
320 KB |
answer = NO |
5 |
Correct |
1 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 |
212 KB |
answer = YES |
9 |
Correct |
1 ms |
212 KB |
answer = NO |
10 |
Correct |
1 ms |
212 KB |
answer = YES |
11 |
Correct |
1 ms |
320 KB |
answer = YES |
12 |
Correct |
1 ms |
212 KB |
answer = NO |
13 |
Correct |
0 ms |
312 KB |
answer = YES |
14 |
Correct |
1 ms |
212 KB |
answer = YES |
15 |
Correct |
1 ms |
212 KB |
answer = YES |
16 |
Correct |
1 ms |
212 KB |
answer = YES |
17 |
Correct |
1 ms |
212 KB |
answer = YES |
18 |
Correct |
0 ms |
320 KB |
answer = YES |
19 |
Correct |
1 ms |
212 KB |
answer = YES |
20 |
Correct |
1 ms |
320 KB |
answer = YES |
21 |
Correct |
1 ms |
212 KB |
answer = YES |
22 |
Correct |
1 ms |
320 KB |
answer = NO |
23 |
Correct |
1 ms |
320 KB |
answer = NO |
24 |
Correct |
1 ms |
212 KB |
answer = YES |
25 |
Correct |
1 ms |
212 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 |
212 KB |
answer = YES |
32 |
Correct |
1 ms |
212 KB |
answer = YES |
33 |
Correct |
1 ms |
212 KB |
answer = YES |
34 |
Correct |
1 ms |
324 KB |
answer = YES |
35 |
Correct |
1 ms |
212 KB |
answer = YES |
36 |
Correct |
1 ms |
212 KB |
answer = YES |
37 |
Execution timed out |
1059 ms |
212 KB |
Time limit exceeded |
38 |
Halted |
0 ms |
0 KB |
- |