oj.uz

Submission #962469

# Submission time Handle Problem Language Result Execution time Memory
962469 2024-04-13T15:39:40 Z Whisper Simple (info1cup19_simple) C++17
30 / 100
 1000 ms 1408 KB 
#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 = LINF;
            for (int j = l; j <= r; ++j){
                if (a[j] & 1) maximize(mx, a[j]);
                else minimize(mn, a[j]);
            }
            cout << (mn == LINF ? -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';
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 504 KB Output is correct
2 Correct 8 ms 600 KB Output is correct
3 Correct 12 ms 656 KB Output is correct
4 Correct 11 ms 620 KB Output is correct
5 Correct 11 ms 604 KB Output is correct
6 Correct 11 ms 616 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1022 ms 1408 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 504 KB Output is correct
2 Correct 8 ms 600 KB Output is correct
3 Correct 12 ms 656 KB Output is correct
4 Correct 11 ms 620 KB Output is correct
5 Correct 11 ms 604 KB Output is correct
6 Correct 11 ms 616 KB Output is correct
7 Execution timed out 1022 ms 1408 KB Time limit exceeded
8 Halted 0 ms 0 KB -