Submission #962467

#TimeUsernameProblemLanguageResultExecution timeMemory
962467WhisperSimple (info1cup19_simple)C++17
0 / 100
1025 ms2468 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; #define int long long #define FOR(i, a, b) for (int i = a; i <= b; i++) #define FORD(i, a, b) for (int i = b; i >= a; i --) #define REP(i, n) for (int i = 0; i < n; ++i) #define REPD(i, n) for (int i = n - 1; i >= 0; --i) #define MASK(i) (1LL << (i)) #define BIT(x, i) (((x) >> (i)) & 1) constexpr ll LINF = (1ll << 60); constexpr int INF = (1ll << 30); constexpr int Mod = 1e9 + 7; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); void setupIO(){ #define name "Whisper" //Phu Trong from Nguyen Tat Thanh High School for gifted student srand(time(NULL)); cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr); //freopen(name".inp", "r", stdin); //freopen(name".out", "w", stdout); cout << fixed << setprecision(10); } template <class X, class Y> bool minimize(X &x, const Y &y){ X eps = 1e-9; if (x > y + eps) {x = y; return 1;} return 0; } template <class X, class Y> bool maximize(X &x, const Y &y){ X eps = 1e-9; if (x + eps < y) {x = y; return 1;} return 0; } int nArr; int numQuery; void Whisper(){ cin >> nArr; vector<int> a(nArr + 1); FOR(i, 1, nArr) cin >> a[i]; cin >> numQuery; FOR(i, 1, numQuery){ int cmd; cin >> cmd; if(cmd == 1){ int l, r; cin >> l >> r; int mx = -1, mn = INF; for (int j = l; j <= r; ++j){ if (a[j] & 1) maximize(mx, a[j]); else minimize(mn, a[j]); } cout << (mn == INF ? -1 : mn) << " " << mx << '\n'; } else{ int l, r, val; cin >> l >> r >> val; FOR(j, l, r) a[j] += val; } } } signed main(){ setupIO(); int Test = 1; // cin >> Test; for ( int i = 1 ; i <= Test ; i++ ){ Whisper(); if (i < Test) cout << '\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...