oj.uz

답안 #153886

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
153886 2019-09-17T10:21:08 Z mhy908 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 193 ms 13124 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define llinf 8987654321987654321
#define inf 1987654321
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
int n, q;
LL s, t;
LL arr[200010], diff[200010];
LL num;
int main()
{
    scanf("%d%d%lld%lld", &n, &q, &s, &t);
    for(int i=0; i<=n; i++){
        scanf("%lld", &arr[i]);
    }
    for(int i=0; i<n; i++){
        if(arr[i]<arr[i+1])num-=s*(arr[i+1]-arr[i]);
        else num-=t*(arr[i+1]-arr[i]);
        diff[i]=arr[i+1]-arr[i];
    }
    for(int i=1; i<=q; i++){
        int a, b;
        LL c;
        scanf("%d %d %lld", &a, &b, &c);
        num+=diff[a-1]>0?diff[a-1]*s:diff[a-1]*t;
        diff[a-1]+=c;
        num-=diff[a-1]>0?diff[a-1]*s:diff[a-1]*t;
        if(b!=n){
            num+=diff[b]>0?diff[b]*s:diff[b]*t;
            diff[b]-=c;
            num-=diff[b]>0?diff[b]*s:diff[b]*t;
        }
        printf("%lld\n", num);
    }
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%lld%lld", &n, &q, &s, &t);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:20:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld", &arr[i]);
         ~~~~~^~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:30:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %lld", &a, &b, &c);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 4 ms 376 KB Output is correct
6 Correct 4 ms 504 KB Output is correct
7 Correct 4 ms 504 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 4 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 444 KB Output is correct
16 Correct 3 ms 472 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 170 ms 10344 KB Output is correct
2 Correct 170 ms 10872 KB Output is correct
3 Correct 177 ms 11512 KB Output is correct
4 Correct 153 ms 10872 KB Output is correct
5 Correct 160 ms 12032 KB Output is correct
6 Correct 131 ms 11000 KB Output is correct
7 Correct 135 ms 11000 KB Output is correct
8 Correct 174 ms 11872 KB Output is correct
9 Correct 180 ms 12200 KB Output is correct
10 Correct 176 ms 10768 KB Output is correct
11 Correct 120 ms 10988 KB Output is correct
12 Correct 124 ms 11720 KB Output is correct
13 Correct 125 ms 11896 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 4 ms 376 KB Output is correct
6 Correct 4 ms 504 KB Output is correct
7 Correct 4 ms 504 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 4 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 444 KB Output is correct
16 Correct 3 ms 472 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 170 ms 10344 KB Output is correct
23 Correct 170 ms 10872 KB Output is correct
24 Correct 177 ms 11512 KB Output is correct
25 Correct 153 ms 10872 KB Output is correct
26 Correct 160 ms 12032 KB Output is correct
27 Correct 131 ms 11000 KB Output is correct
28 Correct 135 ms 11000 KB Output is correct
29 Correct 174 ms 11872 KB Output is correct
30 Correct 180 ms 12200 KB Output is correct
31 Correct 176 ms 10768 KB Output is correct
32 Correct 120 ms 10988 KB Output is correct
33 Correct 124 ms 11720 KB Output is correct
34 Correct 125 ms 11896 KB Output is correct
35 Correct 182 ms 10476 KB Output is correct
36 Correct 193 ms 11792 KB Output is correct
37 Correct 179 ms 12648 KB Output is correct
38 Correct 178 ms 12460 KB Output is correct
39 Correct 179 ms 12424 KB Output is correct
40 Correct 179 ms 12604 KB Output is correct
41 Correct 177 ms 12552 KB Output is correct
42 Correct 182 ms 12352 KB Output is correct
43 Correct 173 ms 11768 KB Output is correct
44 Correct 178 ms 11996 KB Output is correct
45 Correct 160 ms 12076 KB Output is correct
46 Correct 161 ms 13124 KB Output is correct
47 Correct 134 ms 11648 KB Output is correct
48 Correct 140 ms 11744 KB Output is correct
49 Correct 152 ms 10748 KB Output is correct
50 Correct 117 ms 11516 KB Output is correct
51 Correct 127 ms 11972 KB Output is correct
52 Correct 134 ms 11768 KB Output is correct