oj.uz

답안 #390412

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
390412 2021-04-16T03:54:44 Z acm Simple game (IZhO17_game) C++14
22 / 100
 1000 ms 5440 KB 
#include <bits/stdc++.h>
#define speed                   \
  ios_base::sync_with_stdio(0); \
  cin.tie(0);                   \
  cout.tie(0);
#define precision     \
  cout.precision(30); \
  cerr.precision(10);
#define ll long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define forn(n) for (int i = 1; i <= n; i++)
#define forlr(l, r) for (int i = l; i != r; (l > r ? i-- : i++))
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define F first
#define S second
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void ioi(string name) {
  freopen((name + ".in").c_str(), "r", stdin);
  freopen((name + ".out").c_str(), "w", stdout);
}
int n, q, a[1000005], b[1000005];
int main() {
  speed;
  precision;
  // code
  cin >> n >> q;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = 1; i <= n; i++) {
    int x = i;
    if (x > 1) {
      for (int i = min(a[x - 1], a[x]); i <= max(a[x - 1], a[x]); i++) b[i]++;
    }
  }
  while (q--) {
    int type, x, y;
    cin >> type;
    if (type == 1) {
      cin >> x >> y;
      if (x > 1) {
        for (int i = min(a[x - 1], a[x]); i <= max(a[x - 1], a[x]); i++) b[i]--;
      }
      if (x < n) {
        for (int i = min(a[x], a[x + 1]); i <= max(a[x], a[x + 1]); i++) b[i]--;
      }
      a[x] = y;
      if (x > 1) {
        for (int i = min(a[x - 1], a[x]); i <= max(a[x - 1], a[x]); i++) b[i]++;
      }
      if (x < n) {
        for (int i = min(a[x], a[x + 1]); i <= max(a[x], a[x + 1]); i++) b[i]++;
      }
    }
    if (type == 2) {
      cin >> x;
      cout << b[x] << " ";
    }
  }
  // endl
#ifndef ONLINE_JUDGE
  cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
  return 0;
}

Compilation message

game.cpp: In function 'void ioi(std::string)':
game.cpp:26:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   26 |   freopen((name + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
game.cpp:27:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   27 |   freopen((name + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 505 ms 4224 KB Output is correct
3 Correct 544 ms 4344 KB Output is correct
4 Correct 560 ms 4292 KB Output is correct
5 Correct 518 ms 4220 KB Output is correct
6 Correct 510 ms 4228 KB Output is correct
7 Correct 586 ms 4228 KB Output is correct

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 505 ms 4224 KB Output is correct
3 Correct 544 ms 4344 KB Output is correct
4 Correct 560 ms 4292 KB Output is correct
5 Correct 518 ms 4220 KB Output is correct
6 Correct 510 ms 4228 KB Output is correct
7 Correct 586 ms 4228 KB Output is correct
8 Correct 31 ms 1232 KB Output is correct
9 Execution timed out 1091 ms 5440 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 505 ms 4224 KB Output is correct
3 Correct 544 ms 4344 KB Output is correct
4 Correct 560 ms 4292 KB Output is correct
5 Correct 518 ms 4220 KB Output is correct
6 Correct 510 ms 4228 KB Output is correct
7 Correct 586 ms 4228 KB Output is correct
8 Correct 31 ms 1232 KB Output is correct
9 Execution timed out 1091 ms 5440 KB Time limit exceeded
10 Halted 0 ms 0 KB -