New commit

Author: Michael Chen

.DS_Store

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

1089G/1089G.sublime-project

@@ -0,0 +1,53 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef long long ll;
+typedef pair<int, int> pii;
+typedef vector<int> vi;
+
+#define mp make_pair
+#define pb push_back
+
+int main() {
+#if defined(SUBLIME_RUN) || defined(USE_INPUT_FILE)
+    freopen("input.txt", "r", stdin);
+#endif
+    ios::sync_with_stdio(0);
+    int t; cin >> t;
+    vi days(7);
+    
+    while (t--) {
+//        cout << t<< endl;
+        int ans = INT_MAX;
+        int k; cin >> k;
+        int ones = 0;
+        for (int i=0; i<7; ++i) {
+            cin >> days[i];
+            ones += days[i];
+        }
+        
+        int goal = k%ones;
+//         cout << goal << endl;
+        for (int start=0; start<7; ++start) {
+            if (!days[start]) continue;
+            
+            int cur = 1;
+            int ind = start;
+            while (cur != goal) {
+                ++ind;
+//                cout << cur << endl;
+                ind %= 7;
+                if (days[ind]) {
+                    ++cur;
+                    cur %= ones;
+                }
+            }
+            int end = ind;
+           	// printf("%d %d\n", start, end);
+            if (end < start) end += 7;
+            ans = min(ans, 1+7*((k-1)/ones)+end-start);
+        }
+         cout << ans << endl;
+    }
+}
+

1089G/a.out

@@ -0,0 +1,7 @@
+3
+2
+0 1 0 0 0 0 0
+5
+1 0 0 0 1 0 1
+1
+1 0 0 0 0 0 0

1089G/ans.cpp

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

1089G/input.txt

@@ -0,0 +1,35 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef long long ll;
+typedef pair<int, int> pii;
+typedef vector<int> vi;
+
+#define mp make_pair
+#define pb push_back
+
+int main() {
+    #if defined(SUBLIME_RUN) || defined(USE_INPUT_FILE)
+    freopen("input.txt", "r", stdin);
+    #endif
+    ios::sync_with_stdio(0);
+    int n, k;
+    cin >> n >> k;
+    vi a(n);
+    for (int i=0; i<n; ++i) cin >> a[i];
+
+    int ans = 1;
+	int ind = 0;
+	while (ind < n) {
+		int start = ind;
+		while (ind < n && a[ind] != a[ind+1]) {
+			++ind;
+		}
+		// printf("%d %d\n", start, ind);	
+		ind = min(ind, n-1);
+		ans = max(ans, ind-start+1);
+		++ind;
+
+	}
+	cout << ans << endl;
+}

1089G/zzz

@@ -0,0 +1,5 @@
+5 2
+2 2 2 2 2		
+
+8 3
+1 2 3 3 2 1 2 2