icpc final is tomorrow

brpapa · Jul 9, 2021 · 8149397 · 8149397
1 parent adb10d9
commit 8149397
Show file tree

Hide file tree

Showing 6 changed files with 351 additions and 297 deletions.
diff --git a/.vscode/snippets.code-snippets b/.vscode/snippets.code-snippets
@@ -19,6 +19,7 @@
          "#include <bits/stdc++.h>",
          "using namespace std;",
          "typedef long long ll;",
+         "const int INF = 1 << 30;",
          "",
          "int main() {",
          "   $0",

diff --git a/.vscode/tasks.json b/.vscode/tasks.json
@@ -120,12 +120,15 @@
          "description": "Select the folder",
          "type": "pickString",
          "options": [
+            "at-coder",
+            "code-jam",
             "codeforces",
-            "uva",
-            "uri",
+            "kattis",
+            "live-archive",
             "spoj",
-            "code-jam",
-            "live-archive"
+            "timus",
+            "uri",
+            "uva"
          ],
       },
       {

diff --git a/notebook/dynamic-programming/lis.cpp b/notebook/dynamic-programming/lis.cpp
@@ -10,24 +10,23 @@ const int INF = 1 << 30;
 
 /* input */
 vector<int> A = {-7, 10, 5, 2, 3, 8, 8, 1, 2, 3, 4}; int N = 11; 
-
-/*
-   Para cada elemento de A:
-
-   -7: last = {-7}
-   10: last = {-7, 10}
-      5: last = {-7, 5}, pois é uma LIS de tamanho 2 melhor
-      2: last = {-7, 2}
-      3: last = {-7, 2, 3}
-      8: last = {-7, 2, 3, 8}
-      8: last = {-7, 2, 3, 8}
-      1: last = {-7, 1, 3, 8}, pois no futuro a LIS de tamanho 2 {-7, 1} pode ser extendida, mas a melhor LIS atual (não é L) termina em A[6]=8, ou seja, {-7, 2, 3, 8}
-      2: last = {-7, 1, 2, 8}
-      3: last = {-7, 1, 2, 3}, melhor LIS atual é {-7, 1, 2, 3}
-      4: last = {-7, 1, 3, 3, 4}
-*/
 /* O(N * log(N)) */
 int lis0() {
+   /*
+      Para cada elemento de A:
+
+      -7: last = {-7}
+      10: last = {-7, 10}
+         5: last = {-7, 5}, pois é uma LIS de tamanho 2 melhor
+         2: last = {-7, 2}
+         3: last = {-7, 2, 3}
+         8: last = {-7, 2, 3, 8}
+         8: last = {-7, 2, 3, 8}
+         1: last = {-7, 1, 3, 8}, pois no futuro a LIS de tamanho 2 {-7, 1} pode ser extendida, mas a melhor LIS atual (não é L) termina em A[6]=8, ou seja, {-7, 2, 3, 8}
+         2: last = {-7, 1, 2, 8}
+         3: last = {-7, 1, 2, 3}, melhor LIS atual é {-7, 1, 2, 3}
+         4: last = {-7, 1, 3, 3, 4}
+   */
    vector<int> size(N);        // size[j] = tamanho da LIS que termina com A[j]
    vector<int> last(N+1, INF); // last[s] = último elemento da LIS de tamanho s
    last[0] = -INF;

diff --git a/scripts/open-problem-statement.sh b/scripts/open-problem-statement.sh
@@ -10,7 +10,7 @@ then
 fi
 
 # ignore if is no supported
-if [[ $JUDGE != "uva" ]] && [[ $JUDGE != "live_archive" ]] && [[ $JUDGE != "codeforces" ]] && [[ $JUDGE != "uri" ]] && [[ $JUDGE != "spoj" ]] && [[ $JUDGE != "timus" ]]
+if [[ $JUDGE != "uva" ]] && [[ $JUDGE != "live_archive" ]] && [[ $JUDGE != "codeforces" ]] && [[ $JUDGE != "uri" ]] && [[ $JUDGE != "spoj" ]] && [[ $JUDGE != "timus" ]] && [[ $JUDGE != "kattis" ]]
 then
    return
 fi
@@ -21,13 +21,15 @@ FILE_codeforces=${FILE/-//}
 FILE_uri=${FILE}
 FILE_spoj=${FILE}
 FILE_timus=${FILE}
+FILE_kattis=${FILE}
 
 BASE_URL_uva="https://onlinejudge.org/external/"
 BASE_URL_live_archive="https://icpcarchive.ecs.baylor.edu/external/"
 BASE_URL_codeforces="https://codeforces.com/problemset/problem/"
 BASE_URL_uri="https://www.urionlinejudge.com.br/judge/problems/view/"
 BASE_URL_spoj="https://spoj.com/problems/"
 BASE_URL_timus="https://acm.timus.ru/problem.aspx?space=1&num="
+BASE_URL_kattis="https://open.kattis.com/problems/"
 
 url_judge=BASE_URL_$JUDGE
 file_judge=FILE_$JUDGE