oj.uz

답안 #502470

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
502470 2022-01-06T05:10:36 Z khangal Simple game (IZhO17_game) C++14
22 / 100
 1000 ms 30088 KB 
#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 long ll;
typedef double db;
typedef vector<long long> vl;
typedef pair<long long, long long > pl;
const int N = 1e6 + 1;
#define po pop_back
#define pb push_back
#define mk make_pair
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define boost ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18 
#define MIN -1e18
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
//typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
template< typename T>
using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n, m, ans, mid, mn, mx, cnt, sum, h1, h2, arr[3234567],arr1[1234567], sz, k, i, j, h, a, w, x, y, z,par[1234567];
bool used[1234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
vector<ll> edge[1234567];
ll jump[22][223456];
ll lvl[1234567];
//ll bit[1234567];
//ll timer;
//ll st[1234567],endd[1234567];
//ll dp[5005][5005];
ll power(ll base, ll val, ll mod) {
    ll res = 1;
    while (val) {
        if (val % 2 == 1) {
            res = res * base;
        }
        base = base * base;
        base %= mod;
        res %= mod;
        val /= 2;
    }
    return res;
}
bool comp(pl x,pl y){
    if(x.ff>y.ff)return true;
    return false;
}
ll find(ll x){
    if(x==par[x])return x;
    else return par[x]=find(par[x]);
}
void process_LCA(){
    for(int i=1;(1<<i)<=n;i++){
        for(int j=1;j<=n;j++){
            jump[i][j] = jump[i-1][jump[i-1][j]];
        }
    }
}
ll LCA(ll x,ll y){
    if(lvl[x] < lvl[y])swap(x,y);
    ll diss = lvl[x] - lvl[y];
    for(int i=21;i>=0;i--){
        if((1<<i)&diss){
            x = jump[i][x];
        }
    }
    if(x==y)return x;
    for(int i=21;i>=0;i--){
        if(jump[i][x] != jump[i][y]){
            x = jump[i][x];
            y = jump[i][y];
        }
    }
    return jump[0][x];
}
class A {
public:
    static void funcA() {
        cin>>n>>m;
        for(int i=1;i<=n;i++){
            cin>>arr[i];
        }
        while(m--){
            ll type;
            cin>>type;
            if(type==1){
                cin>>x>>y;
                arr[x]=y;
            }
            else{
                cin>>x;
                cnt=0;
                for(int i=1;i<n;i++)cnt+=((arr[i]<=x && arr[i+1] >= x) || (arr[i]>=x && arr[i+1] <=x));
                cout<<cnt<<'\n';
            }
        }
    }
}lol;
void solve() {
    A::funcA();
}
int main() {
    ll T = 1;
    //cin>>T;
    boost;
    while (T--) {
        solve();
    }
}

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 29260 KB Output is correct
2 Correct 20 ms 29220 KB Output is correct
3 Correct 16 ms 29320 KB Output is correct
4 Correct 17 ms 29324 KB Output is correct
5 Correct 16 ms 29260 KB Output is correct
6 Correct 16 ms 29264 KB Output is correct
7 Correct 15 ms 29260 KB Output is correct

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 29260 KB Output is correct
2 Correct 20 ms 29220 KB Output is correct
3 Correct 16 ms 29320 KB Output is correct
4 Correct 17 ms 29324 KB Output is correct
5 Correct 16 ms 29260 KB Output is correct
6 Correct 16 ms 29264 KB Output is correct
7 Correct 15 ms 29260 KB Output is correct
8 Execution timed out 1089 ms 30088 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 29260 KB Output is correct
2 Correct 20 ms 29220 KB Output is correct
3 Correct 16 ms 29320 KB Output is correct
4 Correct 17 ms 29324 KB Output is correct
5 Correct 16 ms 29260 KB Output is correct
6 Correct 16 ms 29264 KB Output is correct
7 Correct 15 ms 29260 KB Output is correct
8 Execution timed out 1089 ms 30088 KB Time limit exceeded
9 Halted 0 ms 0 KB -