提出 #60130355

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef double DOUBLE;
typedef complex<double> point;
#define xx real()
#define yy imag()

#define REP(i, a, b) for(int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for(int i = (a); i <= (int)(b); i++)
#define FA(it, x) for(__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define SZ(x) (int)(x).size()
#define BE(x) (x).begin(), (x).end()
#define SORT(x) sort(BE(x))
#define _1 first
#define _2 second

#define x0 gray_cat_x0
#define y0 gray_cat_y0
#define x1 gray_cat_x1
#define y1 gray_cat_y1
#define j0 gray_cat_j0

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

#define file "I1"

const double EPS = 1e-9;
const double PI = acos(-1.);
const ll LL_INF = 1e17 + 16;
const int INF = 1e9 + 10;
// const ll MOD = 1e9 + 7;
const ll MOD = 998244353;

// Graph solving 2-SAT problem
// Works in O(n + m)

// Use:
// 1) Fill gg.n as number of variables (not number of vertices!!!! 
//    Number of vertices will be gg.n * 2)
// 2) Call gg.add_clause(a, val_a, b, val_b) for each clause.
//    For example, for clause !v[i] | v[j] call gg.add_clause(i, 0, j, 1)
// 3) Call gg.build()

// If gg.IsSatisfiable is false there is no solution
// Otherwise answer will be in boolean array gg.result

// Note number of vertices will be twice more than number of variables
const int MAXN = 1e6 + 5;

struct graph{
	// Number of variables (number of vertices will be 2 * n)
	int n;
	
	// Graph
	vi g[MAXN];
	
	// Reverse graph
	vi gr[MAXN];
	
	// For dfs
	char used[MAXN];
	
	// For topological sorting
	vector<int> sorted;
	
	// Indices of condensation components for vertices
	int col[MAXN];
	
	// Current condensation component index
	int cur_col;
	
	// If has solution
	bool IsSatisfiable;
	
	bool result[MAXN];
	
	void clear(){
		for(int i = 0; i < 2 * n; i++){
			g[i].clear();
			gr[i].clear();
		}
		n = 0;
	}
	
	// Add edge (process clause (a | b) where val_a indicates whether we use a or !a)
	void add_clause(int a, int val_a, int b, int val_b){
		g[(a << 1) ^ val_a ^ 1].pb((b << 1) ^ val_b);
		gr[(b << 1) ^ val_b].pb((a << 1) ^ val_a ^ 1);
		
		g[(b << 1) ^ val_b ^ 1].pb((a << 1) ^ val_a);
		gr[(a << 1) ^ val_a].pb((b << 1) ^ val_b ^ 1);
	}
	
	// Dfs with top sorting
	void dfs(int s){
		used[s] = 1;
		for(int i = 0; i < (int)g[s].size(); i++){
			int to = g[s][i];
			if (!used[to]){
				dfs(to);
			}
		}
		sorted.push_back(s);
	}
	
	// DFS in reverse graph
	void dfs_r(int s){
		used[s] = 1;
		col[s] = cur_col;
		for(int i = 0; i < (int)gr[s].size(); i++){
			int to = gr[s][i];
			if (!used[to]){
				dfs_r(to);
			}
		}
	}
	
	// Building condensation
	void get_condensation(){
		// Init
		for(int i = 0; i < 2 * n; i++){
			used[i] = 0;
		}
		sorted.clear();
	
		// First DFS series
		for(int i = 0; i < 2 * n; i++){
			if (!used[i]){
				dfs(i);
			}
		}
		
		// Init
		for(int i = 0; i < 2 * n; i++){
			used[i] = 0;
		}
		cur_col = 0;
		
		// Second DFS series
		for(int i = 2 * n - 1; i >= 0; i--){
			int s = sorted[i];
			if (!used[s]){
				cur_col++;
				dfs_r(s);
			}
		}
	}
	
	void build(){
		// Get condensation
		get_condensation();
		
		// Find satisfability
		IsSatisfiable = true;
		for(int i = 0; i < 2 * n; i += 2){
			if (col[i] == col[i ^ 1]){
				IsSatisfiable = false;
				break;
			}
			if (col[i] > col[i ^ 1]){
				result[i / 2] = false;
			} else {
				result[i / 2] = true;
			}
		}	
	}
};

graph gg;

char ans[MAXN];

void solve(){
	int n, m, a, b, c;
	scanf("%d%d", &n, &m);
	// TODO: set gg.n
	gg.n = 2 * n;
	REP(i, 0, m) {
		scanf("%d%d%d", &a, &b, &c);
		a--, b--;
		if (c == 0) {
			//gg.add_clause(2 * a, 1, 2 * b + 1, 1);
			//gg.add_clause(2 * a, 0, 2 * b + 1, 0);
			gg.add_clause(2 * a, 0, 2 * b + 1, 1);
			gg.add_clause(2 * a, 1, 2 * b + 1, 0);
		} else {
			//gg.add_clause(2 * a, 1, 2 * b + 1, 0);
			//gg.add_clause(2 * a, 0, 2 * b + 1, 1);
			gg.add_clause(2 * a, 0, 2 * b + 1, 0);
			gg.add_clause(2 * a, 1, 2 * b + 1, 1);
		}
	}
	gg.build();
	if (!gg.IsSatisfiable) {
		printf("-1\n");
		return;
	}
	REP(i, 0, n) {
		bool is_1 = (gg.result[2 * i] && !gg.result[2 * i + 1]);
		bool is_3 = (!gg.result[2 * i] && gg.result[2 * i + 1]);
		if (is_1 || is_3) {
			ans[i] = '1';
		} else {
			ans[i] = '0';
		}
	}
	printf("%s\n", ans);
}

int main(){
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    //freopen(file".in", "r", stdin); freopen(file".out", "w", stdout);
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}

提出情報

コンパイルエラー

Main.cpp: In function ‘void solve()’:
Main.cpp:183:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  183 |         scanf("%d%d", &n, &m);
      |         ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:187:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  187 |                 scanf("%d%d%d", &a, &b, &c);
      |                 ~~~~~^~~~~~~~~~~~~~~~~~~~~~

ジャッジ結果