제출 #925680

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
925680		vjudge1	Joker (BOI20_joker)	C++17	14 / 100	2055 ms	16272 KiB

Joker

//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

#include<bits/stdc++.h>	

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()                 
#define sz(a) (int)a.size()
#define s second
#define f first
 
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
     
vector<pii> rid = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
vector<pii> dir = {{-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
 
const int N = 3e5 + 1, mod = 998244353;

const ll inf = 1e9;
 
double eps = 1e-15;
                                                
bool flg = 0;

int is[N];
bool ok, was[N];
vector<pii> g[N];

void dfs(int u, int l, int r) {
	was[u] = 1;
	for (auto [to, id]: g[u]) {
		if (l <= id && id <= r) continue;
		if (!was[to]) {
			is[to] = 1 - is[u];
			dfs(to, l, r);
		}else if (is[to] == is[u]) ok = 0;
	}
}

void slv() {
	int n, m, q;
	cin >> n >> m >> q;
	for (int i = 1; i <= m; i++) {
		int u, v;
		cin >> u >> v;
		g[u].push_back({v, i});
		g[v].push_back({u, i});
	}
	while (q--) {
		int l, r;
		cin >> l >> r;
		ok = 1;
		for (int i = 1; i <= n; i++) {
			if (!was[i]) 
				dfs(i, l, r);
		}
		if (ok) cout << "NO\n";
		else cout << "YES\n";
		for (int i = 1; i <= n; i++) 
			was[i] = is[i] = 0;
	}
}                                                                           
 
main() {
	//freopen("rsq.in", "r", stdin);                                                                                     
	//freopen("rsq.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(0);	                                                                                       
	cin.tie(0);
	int tp = 1;
	if (flg) cin >> tp;
	while (tp--) {  	
		slv();
	}
}
//wenomechainsama                                              

컴파일 시 표준 에러 (stderr) 메시지

Joker.cpp: In function 'void slv()':
Joker.cpp:66:19: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   66 |    was[i] = is[i] = 0;
      |             ~~~~~~^~~
Joker.cpp: At global scope:
Joker.cpp:70:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main() {
      | ^~~~

• Subtask 1: 6 / 6
• Subtask 2: 8 / 8
• Subtask 3: 0 / 25
• Subtask 4: 0 / 10
• Subtask 5: 0 / 22
• Subtask 6: 0 / 29