oj.uz

Submission #463583

# Submission time Handle Problem Language Result Execution time Memory
463583 2021-08-11T10:38:47 Z Mounir Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 663 ms 16228 KB 
#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define chmin(x, v) x = min(x, v)
#define chmax(x, v) x = max(x, v)
#define all(x) x.begin(), x.end()
#define pb push_back
#define pii pair<int, int>
#define deb first
#define fin second
#define int long long
using namespace std;

const int N = (1 << 18);
int arbre[N * 2];
int T, S;

int getSum(int noeud){
      int sum = 0;
      for (; noeud > 0; noeud /= 2)
            sum += arbre[noeud];
      return sum;
}

void ajouter(int gauche, int droite, int delta){
      while (droite >= gauche){
            if (gauche%2 == 1)
                  arbre[gauche++] += delta;
            if (droite%2 == 0)
                  arbre[droite--] += delta;
            gauche /= 2;
            droite /= 2;
      }
}

int ecarts[N * 2];
void calcEcart(int ind){
      ecarts[N + ind] = getSum(N + ind + 1) - getSum(N + ind);
      if (ecarts[N + ind] < 0)
            ecarts[N + ind] *= -T;
      else
            ecarts[N + ind] *= -S;
      for (int noeud = (N + ind)/2; noeud > 0; noeud /= 2)
            ecarts[noeud] = ecarts[noeud * 2] + ecarts[noeud * 2 + 1];
}

signed main(){ 
      ios::sync_with_stdio(false);
      cin.tie(nullptr);
      cout.tie(nullptr);

      int nMonts, nReqs; cin >> nMonts >> nReqs >> S >> T;
      for (int iMont = 0; iMont <= nMonts; ++iMont){
            cin >> arbre[iMont + N];
            if (iMont > 0)
                  calcEcart(iMont - 1);
      }

      for (int iReq = 0; iReq < nReqs; ++iReq){
            int gauche, droite, delta;
            cin >> gauche >> droite >> delta;

            ajouter(N + gauche, N + droite, delta);
            calcEcart(gauche - 1);
            if (droite != nMonts)
                  calcEcart(droite);
            cout << ecarts[1] << endl;
      }
      return 0;
 
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 597 ms 9220 KB Output is correct
2 Correct 577 ms 14092 KB Output is correct
3 Correct 589 ms 14564 KB Output is correct
4 Correct 602 ms 13988 KB Output is correct
5 Correct 593 ms 15336 KB Output is correct
6 Correct 469 ms 12756 KB Output is correct
7 Correct 477 ms 12584 KB Output is correct
8 Correct 582 ms 15020 KB Output is correct
9 Correct 566 ms 15316 KB Output is correct
10 Correct 554 ms 14016 KB Output is correct
11 Correct 502 ms 12488 KB Output is correct
12 Correct 467 ms 13316 KB Output is correct
13 Correct 510 ms 13472 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 460 KB Output is correct
2 Correct 5 ms 460 KB Output is correct
3 Correct 6 ms 504 KB Output is correct
4 Correct 7 ms 492 KB Output is correct
5 Correct 5 ms 460 KB Output is correct
6 Correct 5 ms 460 KB Output is correct
7 Correct 5 ms 460 KB Output is correct
8 Correct 5 ms 460 KB Output is correct
9 Correct 6 ms 460 KB Output is correct
10 Correct 5 ms 460 KB Output is correct
11 Correct 5 ms 460 KB Output is correct
12 Correct 5 ms 588 KB Output is correct
13 Correct 5 ms 460 KB Output is correct
14 Correct 5 ms 460 KB Output is correct
15 Correct 6 ms 460 KB Output is correct
16 Correct 5 ms 476 KB Output is correct
17 Correct 6 ms 460 KB Output is correct
18 Correct 5 ms 460 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 597 ms 9220 KB Output is correct
23 Correct 577 ms 14092 KB Output is correct
24 Correct 589 ms 14564 KB Output is correct
25 Correct 602 ms 13988 KB Output is correct
26 Correct 593 ms 15336 KB Output is correct
27 Correct 469 ms 12756 KB Output is correct
28 Correct 477 ms 12584 KB Output is correct
29 Correct 582 ms 15020 KB Output is correct
30 Correct 566 ms 15316 KB Output is correct
31 Correct 554 ms 14016 KB Output is correct
32 Correct 502 ms 12488 KB Output is correct
33 Correct 467 ms 13316 KB Output is correct
34 Correct 510 ms 13472 KB Output is correct
35 Correct 642 ms 13528 KB Output is correct
36 Correct 639 ms 15088 KB Output is correct
37 Correct 593 ms 15832 KB Output is correct
38 Correct 610 ms 15604 KB Output is correct
39 Correct 584 ms 15644 KB Output is correct
40 Correct 596 ms 15548 KB Output is correct
41 Correct 609 ms 15432 KB Output is correct
42 Correct 595 ms 15524 KB Output is correct
43 Correct 633 ms 14752 KB Output is correct
44 Correct 662 ms 15236 KB Output is correct
45 Correct 648 ms 15260 KB Output is correct
46 Correct 623 ms 16228 KB Output is correct
47 Correct 500 ms 13292 KB Output is correct
48 Correct 484 ms 13248 KB Output is correct
49 Correct 663 ms 13924 KB Output is correct
50 Correct 484 ms 13064 KB Output is correct
51 Correct 511 ms 13512 KB Output is correct
52 Correct 534 ms 13272 KB Output is correct