oj.uz

Submission #50278

# Submission time Handle Problem Language Result Execution time Memory
50278 2018-06-09T05:49:05 Z 강태규(#1282, imeimi2000) Foehn Phenomena (JOI17_foehn_phenomena) C++11
100 / 100
 259 ms 6700 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <functional>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cstdlib>

using namespace std;
typedef long long llong;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<llong, llong> pll;

const llong inf = 1e18;
char pr[20];
struct lli {
    llong a, b;
    lli& operator+=(llong x) {
        b += x;
        while (inf <= b) {
            b -= inf;
            ++a;
        }
        while (b < 0) {
            b += inf;
            --a;
        }
        return *this;
    }
    lli& operator-=(llong x) {
        return *this += (-x);
    }
    void print() const {
        if (a == 0) {
            printf("%lld\n", b);
            return;
        }
        if (a == -1 && b > 0) {
            printf("%lld\n", b - inf);
            return;
        }
        llong t;
        if (a > 0) {
            printf("%lld", a);
            t = b;
        }
        else {
            printf("%lld", a + (b > 0));
            t = (inf - b) % inf;
        }
        for (int i = 18; i--; ) {
            pr[i] = '0' + t % 10;
            t /= 10;
        }
        printf("%s\n", pr);
    }
};

const int MAXN = 2e5 + 1;
int n, q, s, t;
int a[MAXN];
llong ch[MAXN];

llong getCh(llong x) {
    if (x <= 0) return x * t;
    return x * s;
}

int main() {
	scanf("%d%d%d%d", &n, &q, &s, &t);
	lli sum = { 0ll, 0ll };
	for (int i = 0; i <= n; ++i) {
        scanf("%d", a + i);
        if (i) sum.b -= getCh(ch[i] = a[i] - a[i - 1]);
	}
	
	int l, r, x;
	for (int i = 0; i < q; ++i) {
        scanf("%d%d%d", &l, &r, &x);
        sum += getCh(ch[l]);
        sum -= getCh(ch[l] += x);
        
        if (r < n) {
            sum += getCh(ch[r + 1]);
            sum -= getCh(ch[r + 1] -= x);
        }
        
        sum.print();
	}
	return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:77:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d", &n, &q, &s, &t);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:80:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", a + i);
         ~~~~~^~~~~~~~~~~~~
foehn_phenomena.cpp:86:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &l, &r, &x);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 380 KB Output is correct
2 Correct 4 ms 560 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 3 ms 560 KB Output is correct
5 Correct 3 ms 560 KB Output is correct
6 Correct 3 ms 560 KB Output is correct
7 Correct 3 ms 696 KB Output is correct
8 Correct 5 ms 696 KB Output is correct
9 Correct 4 ms 696 KB Output is correct
10 Correct 3 ms 760 KB Output is correct
11 Correct 3 ms 760 KB Output is correct
12 Correct 3 ms 760 KB Output is correct
13 Correct 3 ms 760 KB Output is correct
14 Correct 3 ms 760 KB Output is correct
15 Correct 3 ms 760 KB Output is correct
16 Correct 4 ms 760 KB Output is correct
17 Correct 3 ms 760 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 2 ms 760 KB Output is correct
20 Correct 2 ms 760 KB Output is correct
21 Correct 2 ms 788 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 4376 KB Output is correct
2 Correct 170 ms 5036 KB Output is correct
3 Correct 259 ms 5668 KB Output is correct
4 Correct 151 ms 5668 KB Output is correct
5 Correct 152 ms 5668 KB Output is correct
6 Correct 151 ms 6012 KB Output is correct
7 Correct 130 ms 6012 KB Output is correct
8 Correct 170 ms 6012 KB Output is correct
9 Correct 166 ms 6060 KB Output is correct
10 Correct 226 ms 6060 KB Output is correct
11 Correct 122 ms 6060 KB Output is correct
12 Correct 143 ms 6212 KB Output is correct
13 Correct 129 ms 6700 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 380 KB Output is correct
2 Correct 4 ms 560 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 3 ms 560 KB Output is correct
5 Correct 3 ms 560 KB Output is correct
6 Correct 3 ms 560 KB Output is correct
7 Correct 3 ms 696 KB Output is correct
8 Correct 5 ms 696 KB Output is correct
9 Correct 4 ms 696 KB Output is correct
10 Correct 3 ms 760 KB Output is correct
11 Correct 3 ms 760 KB Output is correct
12 Correct 3 ms 760 KB Output is correct
13 Correct 3 ms 760 KB Output is correct
14 Correct 3 ms 760 KB Output is correct
15 Correct 3 ms 760 KB Output is correct
16 Correct 4 ms 760 KB Output is correct
17 Correct 3 ms 760 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 2 ms 760 KB Output is correct
20 Correct 2 ms 760 KB Output is correct
21 Correct 2 ms 788 KB Output is correct
22 Correct 170 ms 4376 KB Output is correct
23 Correct 170 ms 5036 KB Output is correct
24 Correct 259 ms 5668 KB Output is correct
25 Correct 151 ms 5668 KB Output is correct
26 Correct 152 ms 5668 KB Output is correct
27 Correct 151 ms 6012 KB Output is correct
28 Correct 130 ms 6012 KB Output is correct
29 Correct 170 ms 6012 KB Output is correct
30 Correct 166 ms 6060 KB Output is correct
31 Correct 226 ms 6060 KB Output is correct
32 Correct 122 ms 6060 KB Output is correct
33 Correct 143 ms 6212 KB Output is correct
34 Correct 129 ms 6700 KB Output is correct
35 Correct 181 ms 6700 KB Output is correct
36 Correct 207 ms 6700 KB Output is correct
37 Correct 179 ms 6700 KB Output is correct
38 Correct 256 ms 6700 KB Output is correct
39 Correct 209 ms 6700 KB Output is correct
40 Correct 210 ms 6700 KB Output is correct
41 Correct 212 ms 6700 KB Output is correct
42 Correct 195 ms 6700 KB Output is correct
43 Correct 178 ms 6700 KB Output is correct
44 Correct 200 ms 6700 KB Output is correct
45 Correct 167 ms 6700 KB Output is correct
46 Correct 167 ms 6700 KB Output is correct
47 Correct 189 ms 6700 KB Output is correct
48 Correct 165 ms 6700 KB Output is correct
49 Correct 162 ms 6700 KB Output is correct
50 Correct 115 ms 6700 KB Output is correct
51 Correct 147 ms 6700 KB Output is correct
52 Correct 151 ms 6700 KB Output is correct