Submission #758217

#	Time	Username	Problem	Language	Result	Execution time	Memory
758217		vjudge1	Simple game (IZhO17_game)	C++17	22 / 100	27 ms	2048 KiB

game

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define endl "\n"
int mod=1e7+9;
const int N=100005;//2e5+5;
template<class x>
using ordered_multiset = tree<x, null_type,less_equal<x>, rb_tree_tag,tree_order_statistics_node_update>;

int nm[N];

signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int n,m; cin>>n>>m;
    int v[n];
    for (int i=0;i<n;i++) cin>>v[i];

    if (n<=1000) {
      while (m--) {
      int t; cin>>t;
      if (t==1) {
        int i,x; cin>>i>>x; i--;
        v[i]=x;
      }
      else {
        int h; cin>>h;
        int ans=0;
        for (int i=0;i+1<n;i++) {
          if ((v[i]<h && v[i+1]>h) || (v[i]>h && v[i+1]<h)) ans++;
        }
        cout<<ans<<endl;
      }
    }
    return 0;
    }

    for (int i=0;i+1<n;i++) {
      nm[min(v[i],v[i+1])]++;
      nm[max(v[i],v[i+1])]--;
    }
    for (int i=1;i<100005;i++) {
      nm[i]+=nm[i-1];
    }
    while (m--) {
      int t,h; cin>>t>>h;
      cout<<nm[h]<<endl;
    }
}

• Subtask 1: 22 / 22
• Subtask 2: 0 / 27
• Subtask 3: 0 / 51