initial commit

Author: Michael Chen

.DS_Store

@@ -0,0 +1,8 @@
+{
+	"folders":
+	[
+		{
+			"path": "/Users/chen.young/code/"
+		}
+	]
+}

.idea/code.iml

@@ -0,0 +1,8 @@
+{
+	"folders":
+	[
+		{
+			"path": "/Users/chen.young/code/222D"
+		}
+	]
+}

.idea/misc.xml

@@ -0,0 +1,33 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef long long ll;
+typedef pair<int, int> pii;
+
+#define mp make_pair
+#define pb push_back
+int nums[100005];
+int main() {
+    #ifdef LOCAL
+    freopen("input.txt", "r", stdin);
+    #endif
+    int n, x;
+    multiset<int> other;
+    scanf("%d%d", &n, &x);
+    for (int i=0; i<2; ++i){
+    	for(int j=0;j<n;++j){
+    		int x; cin >>x;
+    		if (i) nums[j]=x;
+    		else other.insert(x);
+    	}
+    }
+
+    int num=0;
+    for (int i=0; i<n; ++i) {
+    	int k = x-nums[i];
+    	auto it = other.lower_bound(k);
+    	if (it == other.end()) continue;
+    	++num; other.erase(it);
+    }
+    printf("1 %d\n", num);
+}

.idea/modules.xml

@@ -0,0 +1,6 @@
+6 7
+4 3 5 6 4 4
+8 6 0 4 3 4
+5 2
+1 1 1 1 1
+1 1 1 1 1	

.idea/workspace.xml

@@ -0,0 +1,8 @@
+{
+	"folders":
+	[
+		{
+			"path": "/Users/chen.young/code/242D"
+		}
+	]
+}

.sublime-project

@@ -0,0 +1,52 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef long long ll;
+typedef pair<int, int> pii;
+
+#define mp make_pair
+#define pb push_back
+
+const int MAXN=  100005;
+vector<vector<int> > adj;
+int but[MAXN];
+int main() {
+    #ifdef USE_INPUT_FILE
+    freopen("input.txt", "r", stdin);
+    #endif
+    ios::sync_with_stdio(0);
+	int N, M;
+	cin >> N >> M; 
+	adj.resize(N+1);
+	for (int i=0; i<M; ++i) {
+		int a, b; cin >> a >> b;
+		adj[a].pb(b);
+		adj[b].pb(a);
+	}
+	queue<int> q;
+	vector<int> ans;
+	for (int i=1; i<=N; ++i) {
+		cin >> but[i];
+		if (but[i] == 0) {
+			q.push(i);
+		}
+	}
+	while (q.size() ) {
+		int next = q.front(); q.pop();
+		if (but[next] != 0) continue;
+		ans.pb(next);
+		for (int nei : adj[next]) {
+			// printf("%d %d\n", next, nei);
+			--but[nei];
+			if (but[nei] == 0)  {
+				q.push(nei);
+			}
+		}
+	}
+
+	cout << ans.size() << '\n';
+	for (int x : ans) {
+		cout << x << ' ';
+	}
+	cout << '\n';
+}

222D/.DS_Store

@@ -0,0 +1,11 @@
+4 2
+1 2
+3 4
+0 0 0 0
+5 5
+2 3
+4 1
+1 5
+5 3
+2 1
+1 1 2 0 2

222D/222D.sublime-project

@@ -0,0 +1,8 @@
+{
+	"folders":
+	[
+		{
+			"path": "/Users/chen.young/code/363D"
+		}
+	]
+}

222D/ans

@@ -0,0 +1,59 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef long long ll;
+typedef pair<int, int> pii;
+
+#define mp make_pair
+#define pb push_back
+
+const int MAXN = 100005;
+int pers[MAXN];
+int cost[MAXN];
+int N, M, a;
+int s = 0;
+bool can(int x) {
+	vector<int> tp;
+	for (int i=max(N-x, 0); i<N; ++i) {
+		tp.pb(pers[i]);
+	}
+	int ta = a;
+	int used = 0;
+	for (int i=0; i<x; ++i) {
+		if (cost[i] > tp[i] ){
+			ta -= (cost[i] - tp[i]);
+			if (ta < 0) return false;
+		}
+		// printf("%d %d %d\n", x, pers[i], cost[i]);
+		used += min(tp[i], cost[i]);
+	}
+	// printf("%d %d %d\n", x, used, ta);
+	used = max(used-ta, 0);
+	s = used;
+	return true;
+}	
+int main() {
+    #ifdef LOCAL
+    freopen("input.txt", "r", stdin);
+    #endif
+    cin >> N >> M >> a;
+    for (int i=0; i<N; ++i)  {
+    	cin >> pers[i];
+    }
+    sort(pers, pers+N);
+    for(int i=0;i <M; ++i) {
+    	cin >> cost[i];
+    }
+    sort(cost, cost+M);
+    int lb = 0, ub = min(N, M);
+    while (true) {
+    	if (lb == ub) break;
+    	int xs = (lb+ub+1)/2;
+    	if (can(xs)) {
+    		lb = xs;
+    	}
+    	else ub = xs-1;
+    }
+    printf("%d %d\n", lb, s);
+}
+

222D/ans.cpp

@@ -0,0 +1,13 @@
+5 10 100000	
+3 1 9 8 3
+5 1 7 9 8 9 10 2 3 5 3
+
+9 8 3 3
+8 7 3 1
+8 7 3 1
+4 5 2
+8 1 1 2
+6 3 7 5 2
+2 2 10
+5 5
+7 6

222D/input.txt

@@ -0,0 +1,8 @@
+{
+	"folders":
+	[
+		{
+			"path": "/Users/chen.young/code/447D"
+		}
+	]
+}

242D/.DS_Store

@@ -0,0 +1,55 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef long long ll;
+typedef pair<int, int> pii;
+
+#define mp make_pair
+#define pb push_back
+
+vector<vector<int> > sums;
+ll dp[2][(int)1e6+5];
+int rows[1005], cols[1005];
+int main() {
+    #ifdef LOCAL
+    freopen("input.txt", "r", stdin);
+    #endif
+    int N, M, K, P;
+    cin >> N >> M >> K >> P;
+    sums.resize(2);
+    for (int i=0; i<N; ++i) {
+    	for (int j=0; j<M; ++j) {
+    		int x; cin >> x;
+    		rows[i] += x;
+    		cols[j] += x;
+    	}
+    }
+    for (int i=0; i<N; ++i) sums[0].pb(rows[i]);
+    for (int i=0;i<M;++i) sums[1].pb(cols[i]);
+    ll ans = LLONG_MIN;
+    for (int i=0; i<2; ++i) {
+    	priority_queue<int> pq;
+    	for (int j=0; j<sums[i].size(); ++j) {
+    		pq.push(sums[i][j]);
+    		// cout << sums[i][j]<<endl;
+    	}
+    	// cout << endl;
+    	for (int j=1; j<=K; ++j) {
+    		int x =pq.top();
+    		// cout << "x "<<x << endl;
+    		dp[i][j] = dp[i][j-1] + x;
+    		int ins = x - (i ? N*P : M*P);
+    		// cout << ins << endl;
+    		pq.pop();
+    		pq.push(ins);
+    	}
+    	ans = max(ans, dp[i][K]);
+    	// cout << endl;
+    }
+    // cout << ans << endl;
+    for (int i=1; i<=K; ++i) {
+    	ans = max(ans, dp[0][i] + dp[1][K-i] - 1LL*(K-i)*(i*P));
+    	// printf("%d %d\n", i, ans);
+    }
+    cout << ans << endl;
+}

242D/242D.sublime-project

@@ -0,0 +1,16 @@
+6 3 1000000 100
+1 1 1
+1 1 1
+1 1 1
+1 1 1
+1 1 1
+1 1 1
+1 1 2 6
+10
+
+2 2 5 2
+1 3
+2 4
+2 2 2 2
+1 3
+2 4

242D/ans

@@ -0,0 +1,8 @@
+{
+	"folders":
+	[
+		{
+			"path": "/Users/chen.young/code/520D"
+		}
+	]
+}