oj.uz

Submission #398704

# Submission time Handle Problem Language Result Execution time Memory
398704 2021-05-04T18:05:02 Z duality Foehn Phenomena (JOI17_foehn_phenomena) C++11
100 / 100
 143 ms 11456 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

LLI A[200000];
int main() {
    int i;
    int N,Q,S,T;
    int L,R,X;
    LLI ans = 0;
    scanf("%d %d %d %d",&N,&Q,&S,&T);
    for (i = 0; i <= N; i++) scanf("%lld",&A[i]),A[i-1] = A[i]-A[i-1];
    for (i = 0; i < N; i++) {
        if (A[i] >= 0) ans -= (LLI) S*A[i];
        else ans -= (LLI) T*A[i];
    }
    for (i = 0; i < Q; i++) {
        scanf("%d %d %d",&L,&R,&X);
        L--,R--;
        if (A[L] >= 0) ans += (LLI) S*A[L];
        else ans += (LLI) T*A[L];
        A[L] += X;
        if (A[L] >= 0) ans -= (LLI) S*A[L];
        else ans -= (LLI) T*A[L];
        if (R+1 < N) {
            if (A[R+1] >= 0) ans += (LLI) S*A[R+1];
            else ans += (LLI) T*A[R+1];
            A[R+1] -= X;
            if (A[R+1] >= 0) ans -= (LLI) S*A[R+1];
            else ans -= (LLI) T*A[R+1];
        }
        printf("%lld\n",ans);
    }

    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:64:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   64 |     scanf("%d %d %d %d",&N,&Q,&S,&T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:65:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   65 |     for (i = 0; i <= N; i++) scanf("%lld",&A[i]),A[i-1] = A[i]-A[i-1];
      |                              ~~~~~^~~~~~~~~~~~~~
foehn_phenomena.cpp:71:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   71 |         scanf("%d %d %d",&L,&R,&X);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 312 KB Output is correct
10 Correct 2 ms 392 KB Output is correct
11 Correct 2 ms 380 KB Output is correct
12 Correct 2 ms 356 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 2 ms 336 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 8684 KB Output is correct
2 Correct 134 ms 9248 KB Output is correct
3 Correct 136 ms 9796 KB Output is correct
4 Correct 129 ms 9284 KB Output is correct
5 Correct 139 ms 10480 KB Output is correct
6 Correct 115 ms 9544 KB Output is correct
7 Correct 117 ms 9408 KB Output is correct
8 Correct 135 ms 10220 KB Output is correct
9 Correct 135 ms 10564 KB Output is correct
10 Correct 128 ms 9320 KB Output is correct
11 Correct 114 ms 9300 KB Output is correct
12 Correct 121 ms 10060 KB Output is correct
13 Correct 116 ms 10308 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 312 KB Output is correct
10 Correct 2 ms 392 KB Output is correct
11 Correct 2 ms 380 KB Output is correct
12 Correct 2 ms 356 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 2 ms 336 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 138 ms 8684 KB Output is correct
23 Correct 134 ms 9248 KB Output is correct
24 Correct 136 ms 9796 KB Output is correct
25 Correct 129 ms 9284 KB Output is correct
26 Correct 139 ms 10480 KB Output is correct
27 Correct 115 ms 9544 KB Output is correct
28 Correct 117 ms 9408 KB Output is correct
29 Correct 135 ms 10220 KB Output is correct
30 Correct 135 ms 10564 KB Output is correct
31 Correct 128 ms 9320 KB Output is correct
32 Correct 114 ms 9300 KB Output is correct
33 Correct 121 ms 10060 KB Output is correct
34 Correct 116 ms 10308 KB Output is correct
35 Correct 135 ms 8776 KB Output is correct
36 Correct 141 ms 10180 KB Output is correct
37 Correct 137 ms 10968 KB Output is correct
38 Correct 143 ms 10848 KB Output is correct
39 Correct 135 ms 10804 KB Output is correct
40 Correct 136 ms 10872 KB Output is correct
41 Correct 133 ms 10692 KB Output is correct
42 Correct 140 ms 10804 KB Output is correct
43 Correct 131 ms 9996 KB Output is correct
44 Correct 136 ms 10436 KB Output is correct
45 Correct 141 ms 10408 KB Output is correct
46 Correct 134 ms 11456 KB Output is correct
47 Correct 120 ms 10072 KB Output is correct
48 Correct 135 ms 10180 KB Output is correct
49 Correct 128 ms 9128 KB Output is correct
50 Correct 112 ms 9860 KB Output is correct
51 Correct 119 ms 10304 KB Output is correct
52 Correct 114 ms 10052 KB Output is correct