oj.uz

Submission #977394

# Submission time Handle Problem Language Result Execution time Memory
977394 2024-05-07T21:01:02 Z thegamercoder19 Foehn Phenomena (JOI17_foehn_phenomena) C++14
30 / 100
 1000 ms 3928 KB 
/*
Coded by thegamercoder
Happy Competition and Hacking
*/


#define _CRT_SECURE_NO_WARNINGS

#include <bits/stdc++.h>
#define M_PI       3.14159265358979323846
#define FILER 0
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll MOD = pow(10, 9) + 7;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
const ull INFUL = 0x3f3f3f3f3f3f3f3f;
const ll INFT = 0x3f3f3f3f;
const ll MAX = 401;
const ll MODD = 998244353;
const ll BL = 1;
const double EPS = 1e-10;
#define V vector
#define pll pair<ll, ll>
#define pull2 pair<ull,ull>
#define MS multiset
#define M map
#define Q queue
#define PQ priority_queue
#define IOF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define FOR(typ,i,a,b,c) for(typ i = a; i < b; i += c)
#define FORR(typ,i,a,b,c) for(typ i = a; i > b; i -= c)
#define FORA(a,i) for(auto i : a)
#define FORAE(a,i) for(auto &i : a)
#define all(v) v.begin(),v.end()
#define sorta(a) sort(all(a))
#define sortd(a) sort(all(a), greater<ll>())
#define setp(x) setprecision(x)<<fixed
#define RET return
#define log(a,b) log(b)/log(a)
#define WH(s) while(s)
#define WHI(t) WH(t--)
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define Yes cout<<"Yes"<<endl;
#define No cout<<"No"<<endl;
#define YESNO(s) cout<<(s?"YES":"NO")<<endl;
#define YesNo(s) cout<<(s?"Yes":"No")<<endl;
#define TYP 0
using namespace std;
ll n, q, s, t, l, r, x, tc, sc;
V<ll> a;

void solve()
{
    cin >> n >> q >> s >> t;
    n++;
    a.resize(n);
    FOR(ll, i, 0, n, 1)cin >> a[i];
    WHI(q)
    {
        cin >> l >> r >> x;
        //l--, r--;
        FOR(ll, i, l, r + 1, 1)a[i] += x;
        tc = sc = 0;
        FOR(ll, i, 0, n - 1, 1) tc += (a[i] >= a[i + 1]) * (a[i] - a[i+1]), sc += (a[i] < a[i + 1]) * (a[i + 1] - a[i]);
        cout << tc * t - sc * s << endl;
    }

}
void init()
{

    if (FILER)
    {
        freopen("pump.in", "r", stdin);
        freopen("pump.out", "w", stdout);
    }
}

void handle()
{
    init();
    ll t = 1;
    if (TYP)cin >> t;
    WHI(t)solve();
}

int main()
{
    IOF
        handle();
    RET 0;
}

Compilation message

foehn_phenomena.cpp: In function 'void init()':
foehn_phenomena.cpp:76:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |         freopen("pump.in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:77:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |         freopen("pump.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 348 KB Output is correct
2 Correct 10 ms 516 KB Output is correct
3 Correct 9 ms 544 KB Output is correct
4 Correct 9 ms 348 KB Output is correct
5 Correct 9 ms 348 KB Output is correct
6 Correct 9 ms 348 KB Output is correct
7 Correct 9 ms 544 KB Output is correct
8 Correct 10 ms 348 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 9 ms 348 KB Output is correct
11 Correct 9 ms 348 KB Output is correct
12 Correct 10 ms 344 KB Output is correct
13 Correct 11 ms 348 KB Output is correct
14 Correct 13 ms 532 KB Output is correct
15 Correct 10 ms 348 KB Output is correct
16 Correct 9 ms 464 KB Output is correct
17 Correct 11 ms 348 KB Output is correct
18 Correct 11 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 1088 ms 3928 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 348 KB Output is correct
2 Correct 10 ms 516 KB Output is correct
3 Correct 9 ms 544 KB Output is correct
4 Correct 9 ms 348 KB Output is correct
5 Correct 9 ms 348 KB Output is correct
6 Correct 9 ms 348 KB Output is correct
7 Correct 9 ms 544 KB Output is correct
8 Correct 10 ms 348 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 9 ms 348 KB Output is correct
11 Correct 9 ms 348 KB Output is correct
12 Correct 10 ms 344 KB Output is correct
13 Correct 11 ms 348 KB Output is correct
14 Correct 13 ms 532 KB Output is correct
15 Correct 10 ms 348 KB Output is correct
16 Correct 9 ms 464 KB Output is correct
17 Correct 11 ms 348 KB Output is correct
18 Correct 11 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 1088 ms 3928 KB Time limit exceeded
23 Halted 0 ms 0 KB -