updated

Author: coderxiang

Codeforces/20C.cpp

@@ -0,0 +1,82 @@
+#include <cstdio>
+#include <algorithm>
+#include <cstring>
+#include <queue>
+
+using namespace std;
+
+const int N = 100011;
+const int M = 300011;
+const long long INF = 100000011111LL;
+
+int to[M], nxt[M], w[M];
+long long dis[N];
+int eb[N], pa[N], en, n;
+
+void adde (int x, int y, int c) {
+	to[en] = y; w[en] = c; nxt[en] = eb[x]; eb[x] = en++;
+	to[en] = x; w[en] = c; nxt[en] = eb[y]; eb[y] = en++;
+}
+
+void init () {
+	memset (eb, -1, sizeof (eb));
+	en = 0;
+}
+
+long long Dijkstra (int src, int des) {
+	int i, j, k;
+	priority_queue< pair<long long,int> > pq;
+	bool out[N] = {false};
+	int outN = 0;
+	
+	for (i = 1; i <= n; ++i)
+		dis[i] = INF;
+	dis[src] = 0;
+	pq.push (make_pair (0, src));
+
+	while (!pq.empty()) {
+		i = pq.top().second;
+		pq.pop ();
+		if (out[i]) continue;
+		else if ( (++outN) == n) break;
+		out[i] = true;
+		
+		for (int e = eb[i]; e != -1; e = nxt[e]) {
+			j = to[e];
+			if (dis[i] + w[e] < dis[j]) {
+				dis[j] = dis[i] + w[e];
+				pa[j] = i;
+				pq.push (make_pair (-dis[j], j));
+			}
+		}
+	}
+	return dis[des] == INF ? -1 : dis[des];
+}
+
+void output (int x) {
+	if (x == 1) 
+		printf ("1");
+	else {
+		output (pa[x]);
+		printf (" %d", x);
+	}
+}
+
+int main () {
+	int i, j, k, m;
+
+//	freopen ("in", "r", stdin);
+	
+	init ();
+	scanf ("%d%d", &n, &m);
+	for (; m; --m) {
+		scanf ("%d%d%d", &i, &j, &k);
+		adde (i, j, k);
+	}
+	if (Dijkstra (1, n) == -1)
+		printf ("-1");
+	else
+		output (n);
+	printf ("\n");
+	return 0;
+}

Codeforces/21C_21.cpp

@@ -0,0 +1,36 @@
+#include <cstdio>
+#include <algorithm>
+#include <iostream>
+#include <map>
+
+using namespace std;
+
+const int N = 100011;
+
+int s[N];
+map<int,int>M;
+int main () {
+	int i, j, k, n;
+	cin >> n;
+	for (i = 1; i <= n; ++i) {
+		cin >> s[i];
+		s[i] += s[i - 1];
+		M[s[i]] ++;
+	}
+	long long ans = 0;
+	if (s[n] % 3 != 0) {
+		cout << "0" << endl;
+		return 0;
+	}
+
+	int amt = s[n] / 3;
+	for (j = n; j >= 3; --j) {
+		M[s[j]] --;
+		if (s[n] - s[j - 1] != amt) continue;
+		ans += M[amt];
+		if (s[j - 1] == amt)
+			ans --;
+	}
+	cout << ans << endl;
+	return 0;
+}

Codeforces/241A_bayan.cpp

@@ -0,0 +1,45 @@
+#include <cstdio>
+#include <iostream>
+#include <cstring>
+#include <string>
+#include <vector>
+#include <map>
+#include <set>
+#include <algorithm>
+#include <queue>
+
+using namespace std;
+
+const int N = 1011;
+
+int main () {
+	int i, j, k;
+	int n, m;
+	int d[N], s[N];
+
+	//freopen ("in", "r", stdin);
+	
+	scanf ("%d%d", &n, &m);
+	for (i = 2; i <= n + 1; ++i)
+		scanf ("%d", &d[i]);
+	for (i = 1; i <= n; ++i)
+		scanf ("%d", &s[i]);
+
+	int ma = s[1];
+	int curH = 0, L = s[1];
+	for (i = 2; i <= n + 1; ++i) {
+		if (L < d[i]) {
+			while (d[i] > L) {
+				L += ma;
+				curH += m;
+			}
+		}
+		L += s[i] - d[i];
+		curH += d[i];
+		//printf ("%d %d %d\n", i, curH, L);
+		ma = max (ma, s[i]);
+	}
+	printf ("%d\n", curH);
+	return 0;
+}
+

Codeforces/241G_bayan.cpp

@@ -0,0 +1,31 @@
+#include <cstdio>
+#include <string>
+#include <vector>
+#include <map>
+#include <set>
+#include <cmath>
+#include <algorithm>
+#include <queue>
+
+using namespace std;
+
+int main () {
+	int n = 400;
+	int metaN = 400;
+	int ma = 600;
+	int i, j, k;
+
+	printf ("%d\n", n + 2);
+	printf ("%d %d\n", 0, ma * ma);
+	for (i = metaN, j = 0, k = ma * ma; i >= 1; --i) {
+		j += ceil (2 * sqrt (k * (double)i)) + 1;
+		printf ("%d %d\n", j, i);
+		k = i;
+	}
+	printf ("%d %d\n", j + 2 * ma + 1, (ma + 1) * (ma + 1));
+	return 0;
+}
+	
+		
+		
+	

Codeforces/Div II/22A_22.py

@@ -0,0 +1,10 @@
+n = input ();
+v = map (int, raw_input().split());
+v.sort ();
+if v[n - 1] == v[0]:
+	print 'NO'
+else:
+	i = 1;
+	while v[i] == v[i-1]:
+		i += 1;
+	print v[i];

Codeforces/Div II/22D.py

@@ -0,0 +1,34 @@
+n = input ();
+
+v = [(0, 0)] * n;
+ans = [0] * n;
+for i in xrange (n):
+	[a, b] = map (int, raw_input (). split());
+	if a > b:
+		a, b = b, a;
+	v[i] = (a, b);
+
+v.sort ();
+
+cx = v[0][0]; cy = v[0][1];
+
+
+cnt = 0;
+for i in xrange (1, n):
+	wx, wy = v[i][0], v[i][1];
+	if wx > cy:
+		ans[cnt] = cy;
+		cnt += 1
+		cx, cy = wx, wy;
+		
+	else:
+		cx, cy = wx, min (cy, wy);
+
+ans[cnt] = cy;
+cnt += 1;
+print cnt;
+print ' '.join (map (str, ans[:cnt]));
+		
+	
+
+

Codeforces/Div II/237A_147.cpp

@@ -0,0 +1,35 @@
+#include <cstdio>
+#include <algorithm>
+#include <vector>
+
+using namespace std;
+
+
+const int N = 100010;
+
+vector <pair<int,int> > a;
+int n;
+
+int main () {
+	int i, j, k;
+	int ans = 1;
+
+	//freopen ("in", "r", stdin);
+	scanf ("%d", &n);
+	for (i = 0; i < n; ++i) {
+		scanf ("%d%d", &j, &k);
+		a.push_back (make_pair (j, k));
+	}
+	sort (a.begin(), a.end());
+	for (i = 0; i <  n; i++) {
+		int tmp = 1;
+		while (i + 1 < n && a[i] == a[i + 1]) {
+			tmp ++;
+			i++;
+		}
+		ans = max (ans, tmp);
+	}
+	
+	printf ("%d\n", ans);
+	return 0;
+}

Codeforces/Div II/237B_147.cpp

@@ -0,0 +1,59 @@
+#include <cstdio>
+#include <algorithm>
+#include <vector>
+
+using namespace std;
+
+const int N = 100;
+
+int a[N][N];
+int c[N];
+vector <pair<int,int> > pos;
+int n;
+
+int main () {
+	int i, j, k;
+
+//	freopen  ("in", "r", stdin);
+	
+	scanf ("%d", &n);
+	k = 0;
+	for (i = 1; i <= n; ++i) {
+		scanf ("%d", &c[i]);
+		k += c[i];
+	}
+
+	pos.resize (k + 1);
+	for (i = 1; i <= n; ++i) 
+		for (j = 1; j <= c[i]; ++j) {
+			scanf ("%d", &a[i][j]);
+			pos[a[i][j]] = pair<int,int> (i, j);
+		}
+
+	int cnt = 0;
+	vector <vector <int> > ans;
+	for (i = 1; i <= n; ++i)
+		for (j = 1; j <= c[i]; ++j) {
+			cnt ++;
+			if (pos[a[i][j]] != pos[cnt]) {
+				int xx = pos[cnt].first, yy = pos[cnt].second;
+				int arr [4] = {i, j, xx, yy};
+				swap (a[i][j], a[xx][yy]);
+				pos[a[i][j]] = pair<int,int> (i, j);
+				pos[a[xx][yy]] = pair<int,int> (xx, yy);
+				
+				vector <int> b (arr, arr + 4);
+				ans.push_back (b);
+			}
+		}
+	
+	cnt = ans.size ();
+	printf ("%d\n", cnt);
+	for (i = 0; i < cnt; ++i)
+		for (j = 0; j < 4; ++j)
+			printf ("%d%c", ans[i][j], j == 3 ? '\n' : ' ');
+
+	return 0;
+}
+			
+		

Codeforces/Div II/237C_147.cpp

@@ -0,0 +1,57 @@
+#include <cstdio>
+#include <algorithm>
+#include <vector>
+
+using namespace std;
+
+const int N = 1000010;
+
+int cnt[N];
+int a, b, n;
+
+void genPrime () {
+	for (int i = 2; i < N; ++i)
+		cnt[i] = 1;
+	for (int i = 2; i <= 1000; ++i)
+		if (cnt[i]) 
+			for (int j = i * i; j < N; cnt[j] = 0, j += i);
+	for (int i = 1; i < N; ++i)
+		cnt[i] += cnt[i - 1];
+}
+
+bool chk (int x) {
+//	printf ("checking %d %d\n", x, n);
+	for (int i = a; i + x - 1 <= b; ++i) {
+		int j = i + x - 1;
+//		printf ("%d %d %d %d\n", j, i, cnt[j], cnt[i - 1]);
+		if (cnt[j] - cnt[i - 1] < n) return false;
+	}
+	return true;
+}
+
+
+int main () {
+	int i, j, k;
+
+	genPrime ();
+
+	//freopen  ("in", "r", stdin);
+	scanf ("%d%d%d", &a, &b, &n);
+	if (cnt[b] - cnt[a - 1] < n) {
+		printf ("-1\n");
+		return 0;
+	}
+
+//	printf ("%d\n", cnt[b] - cnt[a - 1]);
+
+	int low = 1, up = b - a + 1;
+	while (up > low) {
+		int mid = (up + low) / 2;
+		if (chk (mid))
+			up = mid;
+		else
+			low = mid + 1;
+	}
+	printf ("%d\n", up);
+	return 0;
+}