Submission #117789

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <list>
#include <cassert>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define EPS 1e-9
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii;
typedef long long ll; typedef vector<long long> vl; typedef pair<long long,long long> pll; typedef vector<pair<long long,long long> > vpll;
typedef vector<string> vs; typedef long double ld;

//判定のみ
bool visit(const vector<vector<int> > &g, int v, vector<char> &color) {
	color[v] = 1;
	each(e, g[v]) {
		if(color[*e] == 2) continue;
		if(color[*e] == 1) return false;
		if(!visit(g, *e, color)) return false;
	}
	color[v] = 2;
	return true;
}
bool topologicalSort(const vector<vector<int> > &g) {
	int n = g.size();
	vector<char> color(n);
	rep(u, n) if (!color[u] && !visit(g, u, color))
		return false;
	return true;
}

int n, m;
int p[1000], l[1000], r[1000];
char c[1000];
map<int,int> coords;
vi v;
bool check(int x) {
	vector<vi> g(v.size());
	rep(i, x) {
		if(c[i] == 'w') {
			rer(j, l[i], r[i])
				g[p[i]].pb(j);
		}else {
			rer(j, l[i], r[i])
				g[j].pb(p[i]);
		}
	}
	return topologicalSort(g);
}
int main() {
	cin >> n >> m;
	rep(i, m) {
		cin >> p[i] >> c[i] >> l[i] >> r[i];
		coords[p[i]] = -1;
		coords[l[i]] = -1;
		coords[r[i]] = -1;
	}
	each(i, coords) i->second = v.size(), v.pb(i->first);
	rep(i, m) {
		p[i] = coords[p[i]];
		l[i] = coords[l[i]];
		r[i] = coords[r[i]];
	}
	int L = 0, U = m+1;
	while(U-L>0) {
		int mid = (L+U) / 2;
		if(!check(mid)) U = mid;
		else L = mid+1;
	}
	cout << (U == m+1 ? 0 : U) << endl;
	return 0;
}

Submission Info

Judge Result