Add problems from URI

Author: jhonber

URI/1533.cpp

@@ -0,0 +1,21 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main() {
+  int n;
+  while (cin >> n) {
+    if (!n) break;
+    vector< pair<int, int> > v(n);
+    for (int i = 0; i < n; ++i) {
+      int t;
+      cin >> t;
+      v[i] = {t, i + 1};
+    }
+
+    sort(v.begin(), v.end());
+    reverse(v.begin(), v.end());
+    cout << v[1].second << endl;
+  }
+
+  return 0;
+}

URI/1591.cpp

@@ -0,0 +1,65 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int count (string s, string r) {
+  int pos = 0;
+  int tot = 0;
+  while (s.find(r, pos) != string::npos) {
+    int ind = s.find(r, pos);
+    pos = ind + 1;
+    tot ++;
+  }
+
+  return tot;
+}
+
+int main() {
+  int t;
+  cin >> t;
+
+  for (int i = 0; i < t; ++i) {
+    int n, m;
+    cin >> n >> m;
+
+    map<char, int> mapa;
+    char mat[n][m];
+    vector<string> rows;
+    vector<string> cols(m);
+    for (int j = 0; j < n; ++j) {
+      string s;
+      for (int k = 0; k < m; ++k) {
+        cin >> mat[j][k];
+        s.push_back(mat[j][k]);
+        cols[k].push_back(mat[j][k]);
+        mapa[mat[j][k]] ++;
+      }
+      rows.push_back(s);
+    }
+
+    int q;
+    cin >> q;
+    for (int j = 0; j < q; ++j) {
+      string s;
+      cin >> s;
+
+      int ans = 0;
+      if (s.size() > 1) {
+        for (int k = 0; k < rows.size(); ++k) {
+          ans += count(rows[k], s);
+        }
+
+        for (int k = 0; k < cols.size(); ++k) {
+          ans += count(cols[k], s);
+        }
+      }
+      else {
+        ans += mapa[s[0]];
+      }
+
+      cout << ans << endl;
+    }
+
+  }
+
+  return 0;
+}

URI/1905.cpp

@@ -0,0 +1,50 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int ans;
+int n;
+char mat[11][11];
+int visited[11][11];
+
+bool check(int x, int y) {
+  return x < 0 || x >= n || y < 0 || y >= n;
+}
+
+void dfs(int x, int y) {
+  if (!visited[x][y]) {
+    visited[x][y] = true;
+
+    if (x == n - 1 && y == n - 1) ans = true;
+
+    int dx[] = {-1, 0, 1, 0};
+    int dy[] = {0,  1, 0, -1};
+    for (int i = 0; i < 4; ++i) {
+      int xx = x + dx[i];
+      int yy = y + dy[i];
+      if (!check(xx, yy) && mat[xx][yy] == '0')
+        dfs(xx, yy);
+    }
+  }
+}
+
+int main() {
+  int t;
+  cin >> t;
+
+  n = 5;
+  for (int i = 0; i < t; ++i) {
+    for (int j = 0; j < n; ++j) {
+      for (int k = 0; k < n; ++k) {
+        cin >> mat[j][k];
+      }
+    }
+
+    memset(visited, 0, sizeof visited);
+    ans = false;
+    dfs(0, 0);
+    if (ans) cout << "COPS" << endl;
+    else cout << "ROBBERS" << endl;
+  }
+
+  return 0;
+}