Submission #915491

#TimeUsernameProblemLanguageResultExecution timeMemory
915491vjudge1Simple game (IZhO17_game)C++17
22 / 100
1078 ms1728 KiB
#pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt") #include <bits/stdc++.h> #define int long long #define pb push_back #define ui unsigned int #define ld long double #define pl pair<long long int, long long int> #define boost ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); #define ff first #define ss second #define sz size() #define all(x) x.begin(), x.end() using namespace std; const int maxn = 3e5 + 11; const int inf = 1e17 + 1; const int mod = 1e9 + 7; // const int mod = 998244353; const int dx[] = {-1, 0, 0, 1, -1, -1, 1, 1}; const int dy[] = {0, -1, 1 , 0, -1, 1, -1, 1}; const double eps = 1e-10; void solve() { int n, m; cin >> n >> m; int h[n + 1]; for(int i = 1; i <= n; i++) { cin >> h[ i ]; } while(m--) { int tp; cin >> tp; if(tp == 1) { int pos, val; cin >> pos >> val; h[ pos ] = val; } else { int x; cin >> x; int cnt = 0; for(int i = 2; i <= n; i++) { if((h[i - 1] <= x && x <= h[ i ]) || (h[i - 1] >= x && x >= h[ i ])) { cnt++; } } cout << cnt << "\n"; } } } signed main() { // freopen("sum.in", "r", stdin); // freopen("sum.out", "w", stdout); boost; int tt = 1; // cin >> tt; for(int i = 1; i <= tt; i++) { // cout << "Case " << i << ":\n"; solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...