oj.uz

Submission #590518

# Submission time Handle Problem Language Result Execution time Memory
590518 2022-07-06T05:08:04 Z zeroesandones Simple game (IZhO17_game) C++17
22 / 100
 1000 ms 1620 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;

#define FOR(i, j, k) for (ll i = j; i < (ll) k; ++i)
#define FORD(i, j, k) for (ll i = j; i >= (ll) k; --i)
#define nl "\n"
#define all(x) (x).begin(), (x).end()

#define sc second
#define fr first
#define pb push_back

void print(vi &a) {
    for(auto i : a)
        cout << i << " ";
    cout << nl;
}

void solve()
{
    int n, m;
    cin >> n >> m;

    vi a(n + 1);
    FOR(i, 1, n + 1)
        cin >> a[i];

    FOR(i, 0, m) {
        int x;
        cin >> x;

        if(x == 1) {
            int p, h;
            cin >> p >> h;
            a[p] = h;
        } else {
            int h;
            cin >> h;
            ll cnt = 0;
            FOR(j, 2, n + 1) {
                if((a[j - 1] < h && h < a[j]) || (a[j - 1] > h && h > a[j]))
                    ++cnt;
            }
            cout << cnt << nl;
        }
    }
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    ll t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 452 KB Output is correct
3 Correct 2 ms 336 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 452 KB Output is correct
3 Correct 2 ms 336 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Execution timed out 1087 ms 1620 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 452 KB Output is correct
3 Correct 2 ms 336 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Execution timed out 1087 ms 1620 KB Time limit exceeded
9 Halted 0 ms 0 KB -