結果

問題 No.363 門松サイクル
ユーザー koyumeishikoyumeishi
提出日時 2016-03-18 01:25:45
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 230 ms / 4,000 ms
コード長 3,931 bytes
コンパイル時間 1,041 ms
コンパイル使用メモリ 104,740 KB
実行使用メモリ 35,712 KB
最終ジャッジ日時 2024-10-01 09:00:09
合計ジャッジ時間 7,610 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 3 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 3 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 3 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 3 ms
5,248 KB
testcase_09 AC 69 ms
12,928 KB
testcase_10 AC 68 ms
13,184 KB
testcase_11 AC 155 ms
27,264 KB
testcase_12 AC 171 ms
24,832 KB
testcase_13 AC 142 ms
20,224 KB
testcase_14 AC 110 ms
18,432 KB
testcase_15 AC 142 ms
25,472 KB
testcase_16 AC 114 ms
20,224 KB
testcase_17 AC 230 ms
35,580 KB
testcase_18 AC 173 ms
21,632 KB
testcase_19 AC 137 ms
22,272 KB
testcase_20 AC 169 ms
21,760 KB
testcase_21 AC 219 ms
32,128 KB
testcase_22 AC 150 ms
21,504 KB
testcase_23 AC 180 ms
28,288 KB
testcase_24 AC 2 ms
5,248 KB
testcase_25 AC 1 ms
5,248 KB
testcase_26 AC 153 ms
35,712 KB
testcase_27 AC 148 ms
35,584 KB
testcase_28 AC 171 ms
28,608 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘std::istream& operator>>(std::istream&, std::vector<int>&)’:
main.cpp:18:78: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   18 | istream& operator >> (istream& is, vector<int>& vec){for(int& val: vec) scanf("%d", &val); return is;}
      |                                                                         ~~~~~^~~~~~~~~~~~
main.cpp: In function ‘std::istream& operator>>(std::istream&, std::vector<long long int>&)’:
main.cpp:19:90: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   19 | istream& operator >> (istream& is, vector<long long>& vec){for(long long& val: vec) scanf("%lld",/*"%I64d",*/ &val); return is;}
      |                                                                                     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function ‘std::istream& operator>>(std::istream&, std::vector<double>&)’:
main.cpp:20:84: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   20 | istream& operator >> (istream& is, vector<double>& vec){for(double& val: vec) scanf("%lf", &val); return is;}
      |                                                                               ~~~~~^~~~~~~~~~~~~
main.cpp: In function ‘std::istream& operator>>(std::istream&, std::vector<std::__cxx11::basic_string<char> >&)’:
main.cpp:22:85: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   22 | istream& operator >> (istream& is, vector<string>& vec){for(string& val: vec) {scanf("%s", buff); val=buff;}; return is;}
      |                                                                                ~~~~~^~~~~~~~~~~~
main.cpp: In function ‘int main_()’:
main.cpp:43:22: warning: ignorin

ソースコード

diff # 

#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
using namespace std;
//input from stdin
istream& operator >> (istream& is, vector<int>& vec){for(int& val: vec) scanf("%d", &val); return is;}
istream& operator >> (istream& is, vector<long long>& vec){for(long long& val: vec) scanf("%lld",/*"%I64d",*/ &val); return is;}
istream& operator >> (istream& is, vector<double>& vec){for(double& val: vec) scanf("%lf", &val); return is;}
char buff[200000];
istream& operator >> (istream& is, vector<string>& vec){for(string& val: vec) {scanf("%s", buff); val=buff;}; return is;}
template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(int i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}
template<class T> ostream& operator >> (ostream& os, const T& val){ return os << " " << val;}

bool is_kadomatsu(const vector<int>& v){
	if(v.size()!=3) return false;
	if(v[0]==v[1] || v[1]==v[2] || v[2]==v[0]) return false;
	return (v[0]<v[1] && v[1]>v[2]) || (v[0]>v[1] && v[1]<v[2]);
}

int main_(){
	int n;
	cin >> n;
	vector<int> a(n);
	cin >> a;
	vector<vector<int>> G(n);
	for(int i=0; i<n-1; i++){
		int u,v; //cin >> u,v;
		scanf("%d%d", &u,&v);
		u--,v--;
		G[u].push_back(v);
		G[v].push_back(u);
	}

	vector<int> depth(n, -1);
	vector<int> kadomatsu(n, 0);
	vector<vector<int>> par(n, vector<int>(20));

	function<void(int,int,int)> dfs = [&](int pos, int last, int last2){
		kadomatsu[pos] = is_kadomatsu({a[pos],a[last],a[last2]});
		depth[pos] = depth[last]+1;
		par[pos][0] = last;
		for(int next : G[pos]){
			if(next == last) continue;
			dfs(next, pos, last);
		}
	};
	dfs(0,0,0);

	for(int k=1; k<20; k++){
		for(int i=0; i<n; i++){
			par[i][k] = par[ par[i][k-1] ][k-1];
			kadomatsu[i] |= ( kadomatsu[i] & kadomatsu[ par[i][k-1] ] & (1<<(k-1)) ) << 1;
		}
	}

	auto kth_parent = [&](int pos, int k){
		if(k<0) return -1;
		for(int i=0; k!=0; k>>=1, i++) if(k&1) pos = par[pos][i];
		return pos;
	};

	auto lca = [&](int x, int y){
		if(depth[x] < depth[y]) swap(x,y);
		x = kth_parent(x, depth[x] - depth[y]);
		if(x==y) return x;
		for(int k=19; k>=0; k--){
			if(par[x][k] != par[y][k]){
				x = par[x][k];
				y = par[y][k];
			}
		}
		return par[x][0];
	};

	auto is_kadomatsu_line = [&](int x, int y){
		if(depth[x] < depth[y]) swap(x,y);
		int d = depth[x] - depth[y] - 2;
		if(d<0) return true;
		d++;
		int ok = kadomatsu[x];
		for(int i=0; d!=0; d>>=1, i++){
			if(d&1){
				ok = ok && (kadomatsu[x]>>i);
				x = par[x][i];
			}
		}
		return ok>0;
	};

	int q;
	cin >> q;
	while(q--){
		int u,v;
		scanf("%d%d", &u,&v);
		//cin >> u,v;
		u--,v--;
		assert(u!=v);

		int p = lca(u,v);
		bool ok = true;

		if(p==u || p==v){	//straight line
			if(p==u) swap(u,v); // v==p
			int pu = kth_parent(u, depth[u]-depth[p]-1);
			int qu = par[u][0];
			ok = is_kadomatsu_line(u,p) && is_kadomatsu({a[qu], a[u], a[p]}) && is_kadomatsu({a[u], a[v], a[pu]});
		}else{
			int pu = kth_parent(u, depth[u]-depth[p]-1);
			int pv = kth_parent(v, depth[v]-depth[p]-1);
			int qu = par[u][0];
			int qv = par[v][0];
			ok = (
				is_kadomatsu_line(u,p) &&
				is_kadomatsu_line(v,p) && 
				is_kadomatsu({a[pu], a[p], a[pv]}) &&
				is_kadomatsu({a[qu], a[u], a[v] }) &&
				is_kadomatsu({a[u],  a[v], a[qv]})
				);
		}

		if(ok) puts("YES");
		else puts("NO");
	}
	return 0;
}

int main(){
	//auto s = clock();
	main_();
	//cerr << clock()-s << " [ms] " << endl;
	return 0;
}
0