結果

問題 No.274 The Wall
ユーザー ok
提出日時 2019-11-16 12:03:42
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 3,708 bytes
コンパイル時間 1,083 ms
コンパイル使用メモリ 91,056 KB
実行使用メモリ 130,436 KB
最終ジャッジ日時 2024-09-24 23:17:51
合計ジャッジ時間 3,783 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3 WA * 1
other AC * 10 WA * 12
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

void dfs1(vector<vector<pair<int,int>>> &graph, vector<int> &num, vector<int> &used, int node, int &con){
        
        if(used[node]) return ;
        
        used[node] = true;
        
        for(pair<int,int> next : graph[node]){
                dfs1(graph, num, used, next.first, con);
        }
        
        num[con++] = node;
}

void dfs2(vector<vector<pair<int,int>>> &graph, vector<int> &scc, vector<int> &used, int node, int same){
        
        if(used[node]) return ;
        
        used[node] = true;
        
        for(pair<int,int> next : graph[node]){
                dfs2(graph, scc, used, next.first, same);
        }
        
        scc[node] = same;
}

void Strongly_Connected_Components(vector<vector<pair<int,int>>> &graph, vector<int> &scc){
        vector<int>  used(graph.size()), num(graph.size());
        vector<vector<pair<int,int>>> graph2(graph.size());
        int con = 0;
        
        scc.resize(graph.size());
        
        for(int i = 0; i < graph.size(); i++){
                dfs1(graph, num, used, i, con);
        }
        
        for(int i = 0; i < graph.size(); i++){
                for(int j = 0; j < graph[i].size(); j++){
                        graph2[graph[i][j].first].push_back(make_pair(i, graph[i][j].second));
                }
        }
        
        used.clear();
        used.resize(graph.size());
        
        for(int i = (int)graph.size()-1, same = 0; i >= 0; i--){
                if(!used[num[i]]){
                        dfs2(graph2, scc, used, num[i], same);
                        same++;
                }
        }
        
}


bool two_satisfiability(int num, vector<pair<pair<bool,int>,pair<bool,int>>>& closure, vector<bool>& val){
	vector<vector<pair<int,int>>> graph(num*2);
	vector<int> scc;
	
	val.resize(num);
	
	for(int i = 0; i < closure.size(); i++){
		graph[!closure[i].first.first + closure[i].first.second*2].push_back({closure[i].second.first  + closure[i].second.second*2 ,0});
		graph[!closure[i].second.first + closure[i].second.second*2].push_back({closure[i].first.first  + closure[i].first.second*2 ,0});
	}
	
	Strongly_Connected_Components(graph, scc);
	
	for(int i = 0; i < num*2; i += 2){
		if(scc[i] == scc[i+1]){
			return false;
		} else if(scc[i] > scc[i+1]){
			val[i] = true;
		} else {
			val[i] = false;
		}
	}
	return true;
}

signed main(){
	int N, M;
	vector<pair<int,int>> in;
	vector<bool> val;
	vector<pair<pair<bool,int>,pair<bool,int>>> closure;
	
	cin>>N>>M;

	in.resize(N);

	for(int i = 0; i < N; i++){
		int L, R;
		cin>>in[i*2].first>>in[i*2].second;
	}

	for(int i = 0; i < N; i++){
		for(int j = i+1; j < N; j++){
			pair<int,int> ri{M-in[i*2].second-1, M-in[i*2].first-1}, rj{M-in[j*2].second-1, M-in[j*2].first-1};
			
			if(in[i].second - in[i].first + 1 + in[j].second - in[j].first + 1 > max(in[i].second, in[j].second) - min(in[i].first, in[j].first) + 1) {
				closure.push_back({{true,i},{true,j}});
			}
			
			if(in[i].second - in[i].first + 1 + rj.second - rj.first + 1 > max(in[i].second, rj.second) - min(in[i].first, rj.first) + 1) {
				closure.push_back({{true,i},{false,j}});
			}
			
			if(ri.second - ri.first + 1 + in[j].second - in[j].first + 1 > max(ri.second, in[j].second) - min(ri.first, in[j].first) + 1) {
				closure.push_back({{false,i},{true,j}});
			}
			
			if(ri.second - ri.first + 1 + rj.second - rj.first + 1 > max(ri.second, rj.second) - min(ri.first, rj.first) + 1) {
				closure.push_back({{false,i},{false,j}});
			}
			
		}
	}
	
	if(two_satisfiability(N, closure, val)){
		cout<<"YES"<<endl;
	} else {
		cout<<"NO"<<endl;
	}
	
	return 0;
}
0