Submission #890436

#TimeUsernameProblemLanguageResultExecution timeMemory
890436alex_2008Simple game (IZhO17_game)C++14
22 / 100
1048 ms5460 KiB
#include <bits/stdc++.h> using namespace std; const int N=1e5+5, M=1e6+10; int a[N], b[M]; int n,m; void precalc(){ for(int i=0; i<n-1; i++){ for(int j = min(a[i], a[i+1]); j <= max(a[i], a[i+1]); j++){ b[j]++; } } } int main() { cin>>n>>m; int mx=-1; for(int i=0; i<n; i++){cin>>a[i]; mx=max(mx, a[i]);} if(n <= 1000 && m<=1000){ for(int i=0; i<m; i++){ int q; cin>>q; if(q==2){ long long anss=0; int h; cin>>h; for(int i=0; i<n-1; i++){ if(a[i] >= h && a[i+1] <= h)anss++; else if(a[i] <= h && a[i+1] >= h)anss++; } cout<<anss<<endl; }else{ int c,d; cin>>c>>d; a[c-1] = d; } } return 0; } precalc(); // for(int i=1; i<=mx; i++)cout<<b[i]<<" "; // cout<<endl; for(int i=0; i<m; i++){ int q; cin>>q; if(q==2){ int h; cin>>h; cout<<b[h]<<"\n"; }else{ int a,b; cin>>a>>b; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...