oj.uz

Submission #885492

# Submission time Handle Problem Language Result Execution time Memory
885492 2023-12-09T20:42:01 Z vjudge1 Foehn Phenomena (JOI17_foehn_phenomena) C++17
30 / 100
 1000 ms 1856 KB 
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define db double
#define ll __int128
#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;

const int Max = 1e6 + 7, Inf = 1e9 + 7;

void print(bool x) { cout << (x ? "YES" : "NO") << endl; }

string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}

int ans = 0, n, q, s, t; 

int f(int a, int b)
{
    if(a < b)
        return (a - b) * s; 
    else 
        return (a - b) * t; 
}

int block[500] = { }, sec[200007] = { }, sqrt_n = 480; 

void update(int l, int r, int v)
{
    ans -= f(block[((l - 1) / sqrt_n)] + sec[l - 1], block[((l) / sqrt_n)] + sec[l]); 
    if(r != n) ans -= f(block[((r) / sqrt_n)] + sec[r], block[((r + 1) / sqrt_n)] + sec[r + 1]); 

    for(int i = l; i <= r; i++)
    {
        if((i % sqrt_n == 0) && (i + sqrt_n <= r))
            block[(i / sqrt_n)] += v, i += sqrt_n - 1;
        else
            sec[i] += v;
    }

    ans += f(block[((l - 1) / sqrt_n)] + sec[l - 1], block[((l) / sqrt_n)] + sec[l]); 
    if(r != n) ans += f(block[((r) / sqrt_n)] + sec[r], block[((r + 1) / sqrt_n)] + sec[r + 1]); 
}

void solve()
{
    cin >> n >> q >> s >> t; 

    sqrt_n = n; //sqrt(n) + 1; 
    
    for(int i = 0; i <= n; i++)
    {
        cin >> sec[i]; 
        if(i != 0) ans += f(sec[i-1], sec[i]);

        //cerr << "I: " << i << " " << sec[i-1] << " " << sec[i] << endl; 
    }

    //cerr << ans << endl; 

    while (q--)
    {
        int l, r, x; cin >> l >> r >> x; 
        update(l, r, x); 
        cout << ans << endl; 
    }
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int Q = 1; //cin >> Q;

    while (Q--)
    {
        solve();
    }

    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 348 KB Output is correct
2 Correct 7 ms 504 KB Output is correct
3 Correct 7 ms 348 KB Output is correct
4 Correct 7 ms 484 KB Output is correct
5 Correct 7 ms 348 KB Output is correct
6 Correct 7 ms 348 KB Output is correct
7 Correct 7 ms 600 KB Output is correct
8 Correct 7 ms 484 KB Output is correct
9 Correct 7 ms 348 KB Output is correct
10 Correct 7 ms 348 KB Output is correct
11 Correct 7 ms 348 KB Output is correct
12 Correct 7 ms 512 KB Output is correct
13 Correct 18 ms 492 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 7 ms 348 KB Output is correct
16 Correct 5 ms 348 KB Output is correct
17 Correct 18 ms 508 KB Output is correct
18 Correct 18 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 348 KB Output is correct
2 Correct 7 ms 504 KB Output is correct
3 Correct 7 ms 348 KB Output is correct
4 Correct 7 ms 484 KB Output is correct
5 Correct 7 ms 348 KB Output is correct
6 Correct 7 ms 348 KB Output is correct
7 Correct 7 ms 600 KB Output is correct
8 Correct 7 ms 484 KB Output is correct
9 Correct 7 ms 348 KB Output is correct
10 Correct 7 ms 348 KB Output is correct
11 Correct 7 ms 348 KB Output is correct
12 Correct 7 ms 512 KB Output is correct
13 Correct 18 ms 492 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 7 ms 348 KB Output is correct
16 Correct 5 ms 348 KB Output is correct
17 Correct 18 ms 508 KB Output is correct
18 Correct 18 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Execution timed out 1038 ms 1856 KB Time limit exceeded
23 Halted 0 ms 0 KB -