| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 718919 |
2023-04-05T07:17:40 Z |
Sam_a17 |
Graph (BOI20_graph) |
C++17 |
|
2 ms |
2684 KB |
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt(x) __builtin_popcount(x)
#define pb push_back
#define popf pop_front
#define popb pop_back
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
fastIO();
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 1e5 + 10;
vector<pair<pair<int, int>, int>> edges;
vector<pair<int, int>> adj[N];
vector<int> nodes;
int n, m, vis[N];
int qq[N], it = 1;
void dfs(int node) {
nodes.push_back(node);
for(auto i: adj[node]) {
if(vis[i.first]) continue;
vis[i.first] = it;
qq[i.first] = i.second - qq[node];
dfs(i.first);
}
}
void solve_() {
cin >> n >> m;
for(int i = 1; i <= m; i++) {
int a, b, c; cin >> a >> b >> c;
adj[a].push_back({b, c * 10});
adj[b].push_back({a, c * 10});
edges.push_back({{a, b}, c * 10});
}
for(int i = 1; i <= n; i++) {
if(!vis[i]) {
int good_color = -1, ss = INT32_MAX;
for(int j = 0; j <= 20; j++) {
qq[i] = j;
vis[i] = it;
dfs(i);
bool flag = true;
for(auto k: edges) {
if(vis[k.first.first] == it && vis[k.first.second] == it) {
if(qq[k.first.first] + qq[k.first.second] != k.second) {
flag = false;
break;
}
}
}
if(flag) {
long long sm = 0;
for(auto k: nodes) {
sm += abs(qq[k]);
}
if(sm < ss) {
ss = sm;
good_color = j;
}
}
for(auto k: nodes) {
vis[k] = 0;
}
nodes.clear();
}
if(good_color == -1) {
cout << "NO" << '\n';
return;
} else {
vis[i] = it;
qq[i] = good_color;
dfs(i);
}
}
it++;
}
cout << "YES" << '\n';
for(int i = 1; i <= n; i++) {
long double xx = qq[i];
xx /= 10;
cout << xx << " ";
}
cout << '\n';
}
int main() {
setIO();
auto solve = [&](int test_case)-> void {
while(test_case--) {
solve_();
}
};
int test_cases = 1;
// cin >> test_cases;
solve(test_cases);
return 0;
}
Compilation message
Graph.cpp: In function 'void setIO(std::string)':
Graph.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
64 | freopen((str + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Graph.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
65 | freopen((str + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2644 KB |
answer = YES |
| 2 |
Correct |
2 ms |
2644 KB |
answer = YES |
| 3 |
Correct |
2 ms |
2672 KB |
answer = YES |
| 4 |
Correct |
2 ms |
2684 KB |
answer = NO |
| 5 |
Incorrect |
2 ms |
2644 KB |
participant answer is larger than the answer of jury |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2644 KB |
answer = YES |
| 2 |
Correct |
2 ms |
2644 KB |
answer = YES |
| 3 |
Correct |
2 ms |
2672 KB |
answer = YES |
| 4 |
Correct |
2 ms |
2684 KB |
answer = NO |
| 5 |
Incorrect |
2 ms |
2644 KB |
participant answer is larger than the answer of jury |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2644 KB |
answer = YES |
| 2 |
Correct |
2 ms |
2644 KB |
answer = YES |
| 3 |
Correct |
2 ms |
2672 KB |
answer = YES |
| 4 |
Correct |
2 ms |
2684 KB |
answer = NO |
| 5 |
Incorrect |
2 ms |
2644 KB |
participant answer is larger than the answer of jury |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2644 KB |
answer = YES |
| 2 |
Correct |
2 ms |
2644 KB |
answer = YES |
| 3 |
Correct |
2 ms |
2672 KB |
answer = YES |
| 4 |
Correct |
2 ms |
2684 KB |
answer = NO |
| 5 |
Incorrect |
2 ms |
2644 KB |
participant answer is larger than the answer of jury |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2644 KB |
answer = YES |
| 2 |
Correct |
2 ms |
2644 KB |
answer = YES |
| 3 |
Correct |
2 ms |
2672 KB |
answer = YES |
| 4 |
Correct |
2 ms |
2684 KB |
answer = NO |
| 5 |
Incorrect |
2 ms |
2644 KB |
participant answer is larger than the answer of jury |
| 6 |
Halted |
0 ms |
0 KB |
- |
