oj.uz

Submission #337614

# Submission time Handle Problem Language Result Execution time Memory
337614 2020-12-21T09:12:51 Z boykut Simple game (IZhO17_game) C++14
22 / 100
 1000 ms 4460 KB 
#include <bits/stdc++.h>

using namespace std;

int mas[1000001];

signed main() {
   ios::sync_with_stdio(0);
   cin.tie(0);
   
   int n, m;
   cin >> n >> m;
   
   int h[n];
   
   for (int i = 0; i < n; i++) {
      cin >> h[i];
      if (i) {
         for (int j = h[i - 1]; j <= h[i]; j++) mas[j]++;
         for (int j = h[i - 1]; j >= h[i]; j--) mas[j]++;
      }
   }
   
   for (int test = m; test--;) {
      int x;
      cin >> x;
      
      if (x == 1) {
         int pos, val;
         cin >> pos >> val;
         pos--;
         if (pos) {
            for (int j = h[pos - 1]; j <= h[pos]; j++) mas[j]--;
            for (int j = h[pos - 1]; j >= h[pos]; j--) mas[j]--;
         }
         if (pos + 1 < n) {
            for (int j = h[pos + 1]; j <= h[pos]; j++) mas[j]--;
            for (int j = h[pos + 1]; j >= h[pos]; j--) mas[j]--;
         }
         h[pos] = val;
         if (pos) {
            for (int j = h[pos - 1]; j <= h[pos]; j++) mas[j]++;
            for (int j = h[pos - 1]; j >= h[pos]; j--) mas[j]++;
         }
         if (pos + 1 < n) {
            for (int j = h[pos + 1]; j <= h[pos]; j++) mas[j]++;
            for (int j = h[pos + 1]; j >= h[pos]; j--) mas[j]++;
         }
      } else {
         int H;
         cin >> H;
         cout << mas[H] << '\n';
      }
   }
   
   return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 522 ms 4460 KB Output is correct
3 Correct 540 ms 4368 KB Output is correct
4 Correct 531 ms 4204 KB Output is correct
5 Correct 529 ms 4372 KB Output is correct
6 Correct 513 ms 4332 KB Output is correct
7 Correct 524 ms 4204 KB Output is correct

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 522 ms 4460 KB Output is correct
3 Correct 540 ms 4368 KB Output is correct
4 Correct 531 ms 4204 KB Output is correct
5 Correct 529 ms 4372 KB Output is correct
6 Correct 513 ms 4332 KB Output is correct
7 Correct 524 ms 4204 KB Output is correct
8 Correct 33 ms 1260 KB Output is correct
9 Execution timed out 1096 ms 4460 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 522 ms 4460 KB Output is correct
3 Correct 540 ms 4368 KB Output is correct
4 Correct 531 ms 4204 KB Output is correct
5 Correct 529 ms 4372 KB Output is correct
6 Correct 513 ms 4332 KB Output is correct
7 Correct 524 ms 4204 KB Output is correct
8 Correct 33 ms 1260 KB Output is correct
9 Execution timed out 1096 ms 4460 KB Time limit exceeded
10 Halted 0 ms 0 KB -