oj.uz

Submission #311759

# Submission time Handle Problem Language Result Execution time Memory
311759 2020-10-11T13:45:45 Z kaplanbar Baloni (COCI15_baloni) C++14
0 / 100
 82 ms 7160 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int N = 1e6+5;
int n;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    int mx = 0;
    vector<queue<int>> v(5005);
    for(int i = 0; i < n; i++) {
      int x;
      cin >> x;
      v[x].push(i);
      mx = max(mx, x);
    }
    int c = 0;
    for(int i = mx; i >= 1; i--) {
      if(v[i].empty()) continue;
      c++;
      int now = i;
      int pos = -1;
      while(!v[now].empty()) {
        if(pos < v[now].front()) {
          pos = v[now].front();
          v[now].pop();
          now--;
        }
        else {
          break;
        }
      }
    }
    cout << c << "\n";
    return 0;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 3712 KB Output isn't correct
2 Incorrect 3 ms 3712 KB Output isn't correct
3 Incorrect 3 ms 3712 KB Output isn't correct
4 Incorrect 4 ms 3712 KB Output isn't correct
5 Incorrect 82 ms 6312 KB Output isn't correct
6 Incorrect 82 ms 7160 KB Output isn't correct
7 Incorrect 67 ms 6648 KB Output isn't correct
8 Incorrect 64 ms 6392 KB Output isn't correct
9 Incorrect 76 ms 6520 KB Output isn't correct
10 Incorrect 73 ms 6648 KB Output isn't correct