제출 #1128699

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1128699		Noproblem29	Simple game (IZhO17_game)	C++20	0 / 100	1 ms	324 KiB

game

#include<bits/stdc++.h>
using namespace std;
#ifndef BADGNU
#pragma GCC target("sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;
#define ll long long
#define int ll
#define ld long double
#define y1 cheza
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
const int N=1e5+100;
const int M=5001;
const int B=447;
const int mod=998244353;
const ll INF=1e18;
const int dx[]={1,-1,0,0};
const int dy[]={0,0,1,-1};
const double eps=1e-6;
int n,q;
int a[N];
void test(){
    cin>>n>>q;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int t,x,y;q--;){
        cin>>t;
        if(t==1){
            cin>>x>>y;
            a[x]+=y;
        }
        if(t==2){
            cin>>x;
            int ans=0;
            for(int i=1;i<n;i++){
                if(a[i]<=x&&x<=a[i+1]){
                    ans++;
                }
            }
            for(int i=2;i<=n;i++){
                if(a[i-1]>=x&&x>=a[i]){
                    ans++;
                }
            }
            cout<<ans<<'\n';
        }
    }
}



/*

*/
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    // cout.tie(nullptr);
    int t2=1;
    // cin>>t2;
    for(int i=1;i<=t2;i++){
        test();
    }
}

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