algo

Author: ingyeoking13

.gitignore

@@ -1 +1,3 @@
-kmong
+kmong
+*.out
+*.exe

.vscode/settings.json

@@ -4,7 +4,9 @@
         "queue": "cpp",
         "xiosbase": "cpp",
         "vector": "cpp",
-        "random": "cpp"
+        "random": "cpp",
+        "map": "cpp",
+        "unordered_map": "cpp"
     },
     "code-runner.executorMap": { 
         "c": "cd $dirWithoutTrailingSlash gcc $fileName -g -o $fileNameWithoutExt && ./$fileNameWithoutExt.exe",

atcoder/a.out

@@ -0,0 +1,30 @@
+#include <bits/stdc++.h>
+using ll = long long;
+using namespace std;
+
+int main ()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(0);
+    cout.tie(0);
+
+    int t;
+    cin >> t;
+    while(t--) {
+        int n, k;
+        cin >> n >> k;
+        int cur = 0;
+        int ans = 0;
+
+        int tmp;
+        for (int i=0; i<n; i++){
+            cin>> tmp;
+            if (tmp == 0) {
+                if (cur > 0) ans++, cur--;
+            }
+            else if (tmp >= k) cur += tmp;
+        }
+        
+        cout << ans <<"\n";
+    }
+}

bj/a.exe

@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+using ll = long long;
+using namespace std;
+
+void gg(bool g){
+    string result = g?"NO":"YES";
+    cout << result << "\n";
+} 
+
+int main ()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(0);
+    cout.tie(0);
+
+    int t;
+    cin >> t;
+    while(t--){
+        int n, k;
+        cin >> n >> k;
+
+        bool result = (((ll)n - k + 1 + n) * k / 2)%2;
+        gg(result);
+    }
+}

bj/a.out

@@ -0,0 +1,34 @@
+#include <bits/stdc++.h>
+using ll = long long;
+using namespace std;
+
+int main ()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(0);
+    cout.tie(0);
+
+    int t;
+    cin >> t;
+
+    while(t--) {
+        int n;
+        cin >> n;
+        ll sum = 0;
+        vector<int> v(n);
+        for (int i=0; i<n; i++){
+            cin >> v[i];
+            sum += v[i];
+        }
+        if (n <= 2) {
+            cout << "-1\n";
+            continue;
+        }
+
+        sort(v.begin(), v.end());
+        int target = v[v.size()/2];
+
+        ll ans = ((ll)target) * v.size() * 2 - sum + 1;
+        cout << max(ans,0LL) << "\n";
+    }
+}

bj/p1000/10227.exe

@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+using ll = long long;
+using namespace std;
+
+int main ()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(0);
+    cout.tie(0);
+    int t; 
+    cin >>t; 
+    while(t--){
+        int n, d, k;
+        cin >> n >> d >> k;
+        vector<int> v(n, 0);
+        for (int i=0; i<k; i++){
+
+        }
+
+    }
+
+}

bj/p1000/10875.exe

@@ -0,0 +1,37 @@
+#include <bits/stdc++.h>
+using ll = long long;
+using namespace std;
+
+int main ()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(0);
+    cout.tie(0);
+
+    int t;
+    cin >> t;
+    while(t--) {
+        int n;
+        cin >> n;
+
+        vector<pair<int, int>> v(n, {0, 0});
+        for (int i=0; i<n; i++) {
+            cin >> v[i].first;
+            v[i].second = i;
+        }
+
+        sort(v.begin(), v.end());
+        int mx = 0;
+        for (int i=0; i<n; i++) {
+            int b = v[i].second;
+            if (b%2 == 0) {
+                b = v.size()/2 + v.size()%2;
+            } else {
+                b = v.size()/2;
+            }
+
+            mx = max(v[i].first +b, mx);
+        }
+        cout << mx <<"\n";
+    }
+}

bj/p1000/15991.out

@@ -0,0 +1,54 @@
+#include <bits/stdc++.h>
+using ll = long long;
+using namespace std;
+    
+int main ()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(0);
+    cout.tie(0);
+ 
+    int t;
+    cin >> t;
+ 
+    while(t--) {
+        int n, k;
+        cin >> n >> k;
+ 
+        vector<int> v(n + 1, 0);
+        for (int i=1; i<=n; i++)
+            cin >>v[i];
+        
+        map<ll, ll> answer; 
+ 
+        for (int i=2; i<=n-1; i++) {
+            ll lines = ((ll)(n-i)+(n-1))*i/2 - ((ll)i-2)*(i-1)/2;
+            ll edges = lines - (i - 1);
+            if (answer.find(lines) == answer.end()) {
+                answer[lines] = 1;
+            } 
+            else answer[lines] += 1;
+ 
+            if (answer.find(edges) == answer.end()) {
+                answer[edges] = v[i+1] - v[i] - 1;
+            }
+            else answer[edges] += v[i+1] - v[i] - 1;
+        }
+ 
+        if (answer.find(n-1) == answer.end()) {
+            answer[n-1]=2;
+        } else answer[n-1] += 2;
+        if (answer.find(n-1) == answer.end()) {
+            answer[n-1] = v[2] - v[1] - 1;
+        } else answer[n-1] += v[2] - v[1] - 1;
+ 
+        while(k--) {
+            ll q;
+            cin >> q;
+            cout << answer[q] << " ";
+        }
+ 
+        cout <<"\n";
+    }
+ 
+}

bj/p1000/17143.exe

@@ -0,0 +1,11 @@
+#include <bits/stdc++.h>
+using ll = long long;
+using namespace std;
+
+int main ()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(0);
+    cout.tie(0);
+
+}

bj/p1000/1933.exe

@@ -0,0 +1,6 @@
+2
+20 19
+1036370 22473451 79230551 139333746 144115906 185036320 187837957 249593060 267686123 279814798 303681898 359821500 380577688 512717335 704690515 787940420 824884309 855699669 934336409 951358495
+103 944115487995523977 3 151 299639181507540320 109 43 158 67 67 161 69 9 36 130 64 125 41 7
+19 19
+77675059 97302260 104809111 128683816 160333178 162981920 292965088 416756518 418390138 485874392 543549598 553531805 584454355 674978055 678153322 687778799 716844739 928070184 975461629