結果

問題 No.1420 国勢調査 (Easy)
ユーザー wunderkammer2wunderkammer2
提出日時 2021-06-23 22:28:17
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 315 ms / 2,000 ms
コード長 4,462 bytes
コンパイル時間 2,900 ms
コンパイル使用メモリ 128,388 KB
最終ジャッジ日時 2025-01-22 11:46:01
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<algorithm> //sort,,
#include<bit> //popcount
#include<bitset> //bit
#include<cmath> //pow,log
#include<complex> //
#include<deque> //
#include<fstream> //
#include<functional> //sortgreater
#include<iomanip> //setprecision()
#include<iostream> //
#include<iterator> //(,,)
#include<map> //map()
#include<numeric> //iota(),gcdlcm(c++17)
#include<queue> //
#include<set> //
#include<stack> //
#include<string> //
#include<unordered_map> //map
#include<unordered_set> //set
#include<utility> //pair
#include<vector> //
//#include<atcoder\all>
//using namespace atcoder;
//
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef map<string, int> msi;
typedef map<string, ll> msll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pllll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvll;
typedef vector<vector<string>> vvs;
typedef vector<vector<bool>> vvb;
//
const ll MOD = 1000000007;
const ll INF = 1000000000000000000;
const int MAXR = 100000; //10^5:range
//
#define rep(i,n) for(int i=0;i<n;i++)
#define reps(i,s,e) for(int i=s;i<e;i++)
#define repse(i,s,e) for(int i=s;i<=e;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define in1(x1) cin >> x1
#define in2(x1, x2) cin >> x1 >> x2
#define in3(x1, x2, x3) cin >> x1 >> x2 >> x3
#define in4(x1, x2, x3, x4) cin >> x1 >> x2 >> x3 >> x4
#define in5(x1, x2, x3, x4, x5) cin >> x1 >> x2 >> x3 >> x4 >> x5
#define in6(x1, x2, x3, x4, x5, x6) cin >> x1 >> x2 >> x3 >> x4 >> x5 >> x6
#define inN(x, N) rep(i, N) in1(x[i])
#define outl(x) cout << x << endl
#define out2l(x, y) cout << x << " " << y << endl
#define out3l(x1, x2, x3) cout << x1 << " " << x2 << " " << x3 << endl
#define out4l(x1, x2, x3, x4) cout << x1 << " " << x2 << " " << x3 << " " << x4 << endl
#define outList(x) for(auto y : x) cout << y << " ";cout << endl
//使
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
inline ll div_ceil(ll a, ll b) { return (a + (b - 1)) / b; }
inline string zeropad(int n, int m) { ostringstream sout; sout << setfill('0') << setw(m) << n; return sout.str(); }
class Edge
{
public:
int to;
ll cost;
Edge(int to, ll cost)
{
this->to = to;
this->cost = cost;
}
};
typedef vector<vector<Edge>> Graph;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
//
//std::ifstream in("input.txt");
//std::cin.rdbuf(in.rdbuf());
int N, M;
in2(N, M);
Graph G(N);
rep(_, M)
{
int a, b;
ll c;
cin >> a >> b >> c;
a--;
b--;
G[a].emplace_back(b, c);
G[b].emplace_back(a, c);
}
vll X(N, -1);
rep(i, N)
{
if (X[i] != -1) continue;
queue<Edge> q;
X[i] = 0;
q.emplace(i, X[i]);
while (!q.empty())
{
auto p = q.front(); q.pop();
int n = p.to;
ll x = p.cost;
for (auto a : G[n])
{
int m = a.to;
ll y = a.cost ^ x;
//
if (X[m] != -1)
{
if (y != X[m])
{
outl(-1);
return 0;
}
}
else
{
X[m] = y;
q.emplace(m, X[m]);
}
}
}
}
rep(i, N)
{
outl(X[i]);
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0