Codeforces Round #310(Div. 1) 전체 문제 해결

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 200005
#define maxm 2000005
#define eps 1e-7
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
#define pii pair<int, int>
#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
// head

set<pii> s;
set<pii>::iterator it;
int x[maxn];
int y[maxn];
char ss[maxn];
int n, m;

void work()
{
	x[0] = y[0] = 0;
	s.insert(mp(0, m+1));
	s.insert(mp(n+1, m+1));
	for(int i = 1; i <= m; i++) {
		scanf("%d%d%s", &x[i], &y[i], ss);
		if(ss[0] == 'U') it = s.lower_bound(mp(x[i], -1));
		else {
			it = s.upper_bound(mp(x[i], m+1));
			it--;
		}
		if(it->first == x[i]) {
			printf("0
");
			continue;
		}
		s.insert(mp(x[i], i));
		if(ss[0] == 'U') {
			printf("%d
", y[i] - y[it->second]);
			y[i] = y[it->second];
		}
		else {
			printf("%d
", x[i] - x[it->second]);
			x[i] = x[it->second];
		}
	}
}

int main()
{
	while(scanf("%d%d", &n, &m)!=EOF) {
		work();
	}
	
	
	return 0;
}

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 200005
#define maxm 2000005
#define eps 1e-7
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
#define pii pair<int, int>
#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
// head

map<int, int> mpp;
pii b[maxn];
int a[maxn];
int n, m;

void calc(int pos, int x, int dir)
{
	if(dir == 0 && a[pos] + x < a[pos+1]) {
		printf("%d
", b[pos].second);
		return;
	}
	if(dir == 1 && a[pos] - x > a[pos-1]) {
		printf("%d
", b[pos].second);
		return;
	}
	if(dir == 0) {
		int t, nxt;
		if(a[pos] + x >= a[n]) {
			t = a[n] - a[pos];
			nxt = n;
		}
		else {
			nxt = upper_bound(a+1, a+n+1, a[pos]+x) - a - 1;
			t = a[nxt] - a[pos];
		}
		int tt = x / t;
		if(tt % 2 == 0) calc(pos, x - tt * t, 0);
		else calc(nxt, x - tt * t, 1);
	}
	else {
		int t, nxt;
		if(a[pos] - x <= a[1]) {
			t = a[pos] - a[1];
			nxt = 1;
		}
		else {
			nxt = lower_bound(a+1, a+n+1, a[pos]-x) - a;
			t = a[pos] - a[nxt];
		}
		int tt = x / t;
		if(tt % 2 == 0) calc(pos, x - tt * t, 1);
		else calc(nxt, x - tt * t, 0);
	}
}

void work()
{
	int t, x;
	for(int i = 1; i <= n; i++) scanf("%d", &a[i]), b[i] = mp(a[i], i);
	sort(b+1, b+n+1);
	sort(a+1, a+n+1);
	for(int i = 1; i <= n; i++) mpp[b[i].second] = i;
	while(m--) {
		scanf("%d%d", &t, &x);
		t = mpp[t];
		if(n == 1) {
			printf("1
");
			continue;
		}
		if(a[t] + x >= a[n]) calc(n, x - (a[n] - a[t]), 1);
		else {
			int nxt = upper_bound(a+1, a+n+1, a[t]+x) - a - 1;
			if(nxt == t && nxt == 1) {
				printf("%d
", b[1].second);
				continue;
			}
			t = a[nxt] - a[t];
			calc(nxt, x - t, 1);
		}
	}
}

int main()
{
	while(scanf("%d%d", &n, &m)!=EOF) {
		work();
	}


	return 0;
}

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 200005
#define maxm 400005
#define eps 1e-7
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
#define pii pair<int, int>
#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
// head

struct Edge
{
	int v, next;
	Edge(int v = 0, int next = 0) : v(v), next(next) {} 
}E[maxm << 1];

const int M = 20;

stack<int> s;
pii tpair[maxn];
int H[maxn], cntE, h[maxn];
bool used[maxn];
int bcc[maxn];
int block[maxn];
int dep[maxn];
int dfn[maxn];
int vis[maxn];
int low[maxn];
int anc[maxn][M];
int up[maxn];
int down[maxn];
int n, m, q, ok, dfs_clock, T, bcc_cnt;

void addedges(int u, int v, int *HH)
{
	E[cntE] = Edge(v, HH[u]);
	HH[u] = cntE++;
}

void init()
{
	T = 0;
	dfs_clock = cntE = bcc_cnt = 0;
	memset(H, -1, sizeof H);
	memset(h, -1, sizeof h);
	memset(vis, 0, sizeof vis);
	memset(dfn, 0, sizeof dfn);
	memset(used, 0, sizeof used);
}

void tarjan(int u)
{
	dfn[u] = low[u] = ++dfs_clock;
	s.push(u), block[u] = T;
	for(int e = H[u]; ~e; e = E[e].next) if(!used[e / 2]) {
		used[e / 2] =true;
		int v = E[e].v;
		if(!dfn[v]) {
			tarjan(v);
			low[u] = min(low[u], low[v]);
		}
		else low[u] = min(low[u], dfn[v]);
	}
	if(low[u] == dfn[u]) {
		int t;
		bcc_cnt++;
		do {
			t = s.top();
			bcc[t] = bcc_cnt;
			s.pop();
		}while(t != u);
	}
}

void dfs(int u, int fa)
{
	vis[u] = true;
	anc[u][0] = fa;
	for(int e = h[u]; ~e; e = E[e].next) {
		int v = E[e].v;
		if(vis[v]) continue;
		dep[v] = dep[u] + 1;
		dfs(v, u);
	}
}

void DFS(int u)
{
	vis[u] = true;
	for(int e = h[u]; ~e; e = E[e].next) {
		int v = E[e].v;
		if(vis[v]) continue;
		DFS(v);
		up[u] += up[v];
		down[u] += down[v];
	}
	if(up[u] && down[u]) ok = 0;
}

int to(int u, int d)
{
	for(int i = M - 1; i >= 0; i--) if(dep[anc[u][i]] >= d) u = anc[u][i];
	return u;
}

int lca(int u, int v)
{
	if(dep[u] < dep[v]) swap(u, v);
	u = to(u, dep[v]);
	for(int i = M - 1; i >= 0; i--) if(anc[u][i] != anc[v][i]) u = anc[u][i], v = anc[v][i];
	return u == v ? u : anc[u][0];
}

void work()
{
	int u, v;
	for(int i = 1; i <= m; i++) {
		scanf("%d%d", &u, &v);
		tpair[i] = mp(u, v);
		addedges(u, v, H);
		addedges(v, u, H); 
	}
	for(int i = 1; i <= n; i++) if(!dfn[i]) {
		T++;
		tarjan(i);
	}

	for(int i = 1; i <= m; i++) {
		u = bcc[tpair[i].first];
		v = bcc[tpair[i].second];
		if(u == v) continue;
		addedges(u, v, h);
		addedges(v, u, h);
	}
	
	for(int i = 1; i <= bcc_cnt; i++) if(!vis[i]) dfs(i, i);
	for(int i = 1; i < M; i++)
		for(int j = 1; j <= n; j++)
			anc[j][i] = anc[anc[j][i-1]][i-1];
	ok = 1;
	for(int i = 1; i <= q; i++) {
		scanf("%d%d", &u, &v);
		if(block[u] != block[v]) ok = 0;
		u = bcc[u];
		v = bcc[v];
		int c = lca(u, v);
		up[u]++;
		up[c]--;
		down[v]++;
		down[c]--;
	}
	memset(vis, 0, sizeof vis);
	for(int i = 1; i <= bcc_cnt; i++) if(!vis[i]) DFS(i);
	printf("%s
", ok ? "Yes" : "No");
}

int main()
{
	while(scanf("%d%d%d", &n, &m, &q)!=EOF) {
		init();
		work();
	}
	
	return 0;
}