oj.uz

Submission #540669

# Submission time Handle Problem Language Result Execution time Memory
540669 2022-03-21T10:57:19 Z Carmel_Ab1 Simple game (IZhO17_game) C++17
100 / 100
 181 ms 18664 KB 
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 */
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1, T2>& p){is >> p.first >> p.second;return is;}
template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1, T2>& p){os <<"" << p.first << " " << p.second << ""; return os;}
void usaco(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}
template<typename T>
void read(vector<T>& v){
    int n=v.size();
    for(int i=0; i<n; i++)
        cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
    vector<T>ans;
    for(T t:a)
        if(ans.empty() || t!=ans.back())
            ans.push_back(t);
    return ans;
}



void solve();
int main(){
    GLHF;
    int t=1;
    //cin >> t;
    while(t--)
        solve();
}

struct seg{
    vi t;
    int sz=1;

    seg(int n){
        sz=2*n;
        t.resize(sz);
    }
    void upd(int l,int r,int v){
        for(l+=sz/2,r+=sz/2 +1; l<r; l/=2,r/=2){
            if(l&1)t[l++]+=v;
            if(r&1)t[--r]+=v;
        }
    }
    int qur(int i){
        int ans=0;
        i+=sz/2;
        while(i){
            ans+=t[i];
            i/=2;
        }
        return ans;
    }
};


void solve() {
    int n,q;
    cin >> n >> q;
    vi a(n+1);

    seg ST(2e6 +1);
    for(int i=1; i<=n; i++)
        cin >> a[i];

    for(int i=1; i<n; i++)
        ST.upd(min(a[i],a[i+1]),max(a[i],a[i+1]),1);

    while(q--){
        int op;
        cin >> op;
        if(op==2){
            int x;
            cin >> x;
            cout << ST.qur(x) << endl;
        }
        else{
            int i,v;
            cin >> i >> v;

            if(i<n)
                ST.upd(min(a[i],a[i+1]),max(a[i],a[i+1]),-1);
            if(i>1)
                ST.upd(min(a[i],a[i-1]),max(a[i],a[i-1]),-1);

            a[i]=v;

            if(i<n)
                ST.upd(min(a[i],a[i+1]),max(a[i],a[i+1]),1);
            if(i>1)
                ST.upd(min(a[i],a[i-1]),max(a[i],a[i-1]),1);
        }
    }
}
/*
 3 3
1 5 1
2 3
1 1 5
2 3
 */

Compilation message

game.cpp: In function 'void usaco(std::string)':
game.cpp:47:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
game.cpp:48:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15956 KB Output is correct
2 Correct 8 ms 16084 KB Output is correct
3 Correct 8 ms 15956 KB Output is correct
4 Correct 9 ms 15900 KB Output is correct
5 Correct 8 ms 15956 KB Output is correct
6 Correct 8 ms 15956 KB Output is correct
7 Correct 9 ms 15968 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15956 KB Output is correct
2 Correct 8 ms 16084 KB Output is correct
3 Correct 8 ms 15956 KB Output is correct
4 Correct 9 ms 15900 KB Output is correct
5 Correct 8 ms 15956 KB Output is correct
6 Correct 8 ms 15956 KB Output is correct
7 Correct 9 ms 15968 KB Output is correct
8 Correct 149 ms 16748 KB Output is correct
9 Correct 181 ms 18664 KB Output is correct
10 Correct 175 ms 18504 KB Output is correct
11 Correct 146 ms 17208 KB Output is correct
12 Correct 158 ms 18320 KB Output is correct
13 Correct 167 ms 18508 KB Output is correct

Subtask #3
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15956 KB Output is correct
2 Correct 8 ms 16084 KB Output is correct
3 Correct 8 ms 15956 KB Output is correct
4 Correct 9 ms 15900 KB Output is correct
5 Correct 8 ms 15956 KB Output is correct
6 Correct 8 ms 15956 KB Output is correct
7 Correct 9 ms 15968 KB Output is correct
8 Correct 149 ms 16748 KB Output is correct
9 Correct 181 ms 18664 KB Output is correct
10 Correct 175 ms 18504 KB Output is correct
11 Correct 146 ms 17208 KB Output is correct
12 Correct 158 ms 18320 KB Output is correct
13 Correct 167 ms 18508 KB Output is correct
14 Correct 159 ms 18528 KB Output is correct
15 Correct 159 ms 18580 KB Output is correct
16 Correct 175 ms 18524 KB Output is correct
17 Correct 157 ms 18508 KB Output is correct
18 Correct 155 ms 18504 KB Output is correct