oj.uz

Submission #1113374

# Submission time Handle Problem Language Result Execution time Memory
1113374 2024-11-16T13:39:42 Z ntdaccode Real Mountains (CCO23_day1problem2) C++17
12 / 25
 339 ms 113996 KB 
#include<bits/stdc++.h>
#define fori(i,a,b) for(int i = a;i <= b; i++)
#define int long long
#define pb push_back
using namespace std;

typedef pair<int,int> ii;
typedef tuple<int,int,int> tp;

const int M = 1e6 + 10;
const int N = 5e3 + 10;
const int mod = 1e6 + 3;

int n,h[N];
int target[N];
vector<int> Q[N];
vector<int> rrh;
int calc(int l,int r) {
  return ((l + r) * (r - l + 1) / 2) % mod;
}
int add(int a,int b) {
  return (a + b) % mod;
}
int32_t main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  if(fopen("1.inp","r"))
  {
    freopen("1.inp","r",stdin);
    freopen("1.out","w",stdout);
  }
  #define task ""
  if(fopen(task".inp","r"))
  {
    freopen(task".inp","r",stdin);
    freopen(task".out","w",stdout);
  }
  cin >> n;
  for(int i = 1;i <= n; i++) cin >> h[i];

  int suf = 0,pre = 0;
  for(int i = 1;i <= n; i++) {
    pre = max(pre, h[i]);
    target[i] =  pre ;
  }
  for(int i = n; i != 0; i--) {
    suf = max(suf, h[i]);
    target[i] = min(target[i], suf);
  }

  for(int i = 1;i <= n; i++) rrh.pb(h[i]);
  sort(rrh.begin(),rrh.end());
  rrh.resize(unique (rrh.begin(), rrh.end()) - rrh.begin());
  for(int i = 1;i <= n; i++) {
      h[i] = lower_bound(rrh.begin(),rrh.end(),h[i]) - rrh.begin() ;
      target[i] = lower_bound(rrh.begin(),rrh.end(),target[i]) - rrh.begin() ;
      //cout << h[i] << " " << target[i] << "\n";
  }

  for(int i = 1;i <= n; i++) {
    if(h[i] != target[i]) {
      Q[h[i]].pb(i);

    }
  }
  int kq = 0;
  int m = rrh.size();
  for(int high = 0;high <= m - 2; high++) {
    int sz = Q[high].size();
    if(sz == 0) continue;
    int val = rrh[high] % mod;
    int nxt_val = rrh[high + 1] % mod;
    if(sz == 1) {

      int x = 1e9 , y = 1e9 , cur = Q[high][0];
      for(int j = 1; j < cur; j++) {
        if(h[j] > h[cur]) x = min(x,rrh[h[j]]);
      }
      for(int j = cur + 1; j <= n ;j++) {
        if(h[j] > h[cur]) y = min(y,rrh[h[j]]);
      }
      x %= mod;
      y %= mod;
      kq = (kq + (nxt_val - val)*(x + y) % mod  ) % mod;
      h[cur]++;
      if(h[cur] != target[cur]) Q[h[cur]].pb(cur);


    }
    else {
      sort(Q[high].begin(),Q[high].end());
      int pre_l = 1e9 , pre_r = 1e9 , suf_l = 1e9 , suf_r = 1e9;
      int l = Q[high][0], r = Q[high].back();
      for(int j = 1;j < l ; j++) {
        if(h[j] > h[l]) pre_l = min(pre_l,rrh[h[j]]);
      }
      for(int j = l + 1;j <= n; j++) {
        if(h[j] > h[l]) suf_l = min(suf_l,rrh[h[j]]);
      }
      for(int j = 1; j < r; j++) {
        if(h[j] > h[r]) pre_r = min(pre_r,rrh[h[j]]);
      }
      for(int j = r + 1;j <= n; j++) {
        if(h[j] > h[r]) suf_r = min(suf_r,rrh[h[j]]);
      }

//      cout << Q[high].size() << " " << pre_l << " " << suf_l << " " << pre_r << " " << suf_r << "\n";
//      cout << val << " " << nxt_val << " ";
//      cout << calc(val,nxt_val - 1) << " ";
//      cout << calc(val + 1,nxt_val) << "\n";

      int x =(rrh[high + 1] - rrh[high]) * add(pre_l,suf_l) + (rrh[high + 1] - rrh[high]) * suf_r ;
      int y =(rrh[high + 1] - rrh[high]) * add(pre_r,suf_r) + (rrh[high + 1] - rrh[high]) * pre_l ;
      //cout << x  <<  " " << y << "a\n";
      x = min(x,y) % mod;
      kq = (kq + x) % mod;
      //cout << kq << "a\n";
      kq = ( kq + (sz - 2) * 2ll * calc(val + 1 ,nxt_val) % mod + calc(val + 1,nxt_val)) % mod;
      for(int idx : Q[high]) {
          h[idx]++;
          if(h[idx] != target[idx]) Q[h[idx]].pb(idx);
      }
    }

    kq = (kq + sz * calc(val,nxt_val - 1) % mod) % mod;
    //cout << val << " " << nxt_val << " " << sz * calc(val,nxt_val - 1) << " " <<  kq << '\n';
  }
  cout << kq % mod;
}

Compilation message

Main.cpp: In function 'int32_t main()':
Main.cpp:31:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |     freopen("1.inp","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~
Main.cpp:32:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |     freopen("1.out","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~
Main.cpp:37:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     freopen(task".inp","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
Main.cpp:38:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     freopen(task".out","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 14 ms 2896 KB Output is correct
5 Correct 2 ms 592 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 16 ms 2996 KB Output is correct
12 Correct 8 ms 2896 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 14 ms 2896 KB Output is correct
5 Correct 2 ms 592 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 16 ms 2996 KB Output is correct
12 Correct 8 ms 2896 KB Output is correct
13 Correct 17 ms 2896 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 19 ms 2896 KB Output is correct
17 Correct 16 ms 2896 KB Output is correct
18 Correct 17 ms 2896 KB Output is correct
19 Correct 17 ms 2900 KB Output is correct
20 Correct 3 ms 848 KB Output is correct
21 Correct 3 ms 848 KB Output is correct
22 Correct 4 ms 848 KB Output is correct
23 Correct 14 ms 3064 KB Output is correct
24 Correct 16 ms 2896 KB Output is correct
25 Correct 14 ms 2896 KB Output is correct
26 Correct 11 ms 2640 KB Output is correct
27 Correct 12 ms 2896 KB Output is correct
28 Correct 12 ms 2896 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 14 ms 2896 KB Output is correct
5 Correct 2 ms 592 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 16 ms 2996 KB Output is correct
12 Correct 8 ms 2896 KB Output is correct
13 Correct 17 ms 2896 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 19 ms 2896 KB Output is correct
17 Correct 16 ms 2896 KB Output is correct
18 Correct 17 ms 2896 KB Output is correct
19 Correct 17 ms 2900 KB Output is correct
20 Correct 3 ms 848 KB Output is correct
21 Correct 3 ms 848 KB Output is correct
22 Correct 4 ms 848 KB Output is correct
23 Correct 14 ms 3064 KB Output is correct
24 Correct 16 ms 2896 KB Output is correct
25 Correct 14 ms 2896 KB Output is correct
26 Correct 11 ms 2640 KB Output is correct
27 Correct 12 ms 2896 KB Output is correct
28 Correct 12 ms 2896 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 309 ms 112480 KB Output is correct
36 Correct 319 ms 112712 KB Output is correct
37 Correct 291 ms 113480 KB Output is correct
38 Correct 309 ms 113224 KB Output is correct
39 Correct 280 ms 113004 KB Output is correct
40 Correct 3 ms 848 KB Output is correct
41 Correct 3 ms 848 KB Output is correct
42 Correct 3 ms 1016 KB Output is correct
43 Correct 300 ms 113548 KB Output is correct
44 Correct 261 ms 113480 KB Output is correct
45 Correct 258 ms 113224 KB Output is correct
46 Correct 269 ms 110408 KB Output is correct
47 Correct 287 ms 110156 KB Output is correct
48 Correct 285 ms 108688 KB Output is correct

Subtask #4
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 14 ms 2896 KB Output is correct
5 Correct 2 ms 592 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 16 ms 2996 KB Output is correct
12 Correct 8 ms 2896 KB Output is correct
13 Correct 17 ms 2896 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 19 ms 2896 KB Output is correct
17 Correct 16 ms 2896 KB Output is correct
18 Correct 17 ms 2896 KB Output is correct
19 Correct 17 ms 2900 KB Output is correct
20 Correct 3 ms 848 KB Output is correct
21 Correct 3 ms 848 KB Output is correct
22 Correct 4 ms 848 KB Output is correct
23 Correct 14 ms 3064 KB Output is correct
24 Correct 16 ms 2896 KB Output is correct
25 Correct 14 ms 2896 KB Output is correct
26 Correct 11 ms 2640 KB Output is correct
27 Correct 12 ms 2896 KB Output is correct
28 Correct 12 ms 2896 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 309 ms 112480 KB Output is correct
36 Correct 319 ms 112712 KB Output is correct
37 Correct 291 ms 113480 KB Output is correct
38 Correct 309 ms 113224 KB Output is correct
39 Correct 280 ms 113004 KB Output is correct
40 Correct 3 ms 848 KB Output is correct
41 Correct 3 ms 848 KB Output is correct
42 Correct 3 ms 1016 KB Output is correct
43 Correct 300 ms 113548 KB Output is correct
44 Correct 261 ms 113480 KB Output is correct
45 Correct 258 ms 113224 KB Output is correct
46 Correct 269 ms 110408 KB Output is correct
47 Correct 287 ms 110156 KB Output is correct
48 Correct 285 ms 108688 KB Output is correct
49 Correct 316 ms 113392 KB Output is correct
50 Correct 310 ms 113224 KB Output is correct
51 Correct 325 ms 113224 KB Output is correct
52 Correct 315 ms 113224 KB Output is correct
53 Correct 339 ms 113736 KB Output is correct
54 Correct 4 ms 848 KB Output is correct
55 Correct 4 ms 848 KB Output is correct
56 Correct 4 ms 848 KB Output is correct
57 Correct 285 ms 113928 KB Output is correct
58 Correct 317 ms 113984 KB Output is correct
59 Correct 286 ms 113996 KB Output is correct
60 Correct 305 ms 110972 KB Output is correct
61 Correct 305 ms 111176 KB Output is correct
62 Correct 292 ms 111688 KB Output is correct

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 14 ms 2896 KB Output is correct
5 Correct 2 ms 592 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 16 ms 2996 KB Output is correct
12 Correct 8 ms 2896 KB Output is correct
13 Correct 17 ms 2896 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 19 ms 2896 KB Output is correct
17 Correct 16 ms 2896 KB Output is correct
18 Correct 17 ms 2896 KB Output is correct
19 Correct 17 ms 2900 KB Output is correct
20 Correct 3 ms 848 KB Output is correct
21 Correct 3 ms 848 KB Output is correct
22 Correct 4 ms 848 KB Output is correct
23 Correct 14 ms 3064 KB Output is correct
24 Correct 16 ms 2896 KB Output is correct
25 Correct 14 ms 2896 KB Output is correct
26 Correct 11 ms 2640 KB Output is correct
27 Correct 12 ms 2896 KB Output is correct
28 Correct 12 ms 2896 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Incorrect 2 ms 592 KB Output isn't correct
36 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 14 ms 2896 KB Output is correct
5 Correct 2 ms 592 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 16 ms 2996 KB Output is correct
12 Correct 8 ms 2896 KB Output is correct
13 Correct 17 ms 2896 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 19 ms 2896 KB Output is correct
17 Correct 16 ms 2896 KB Output is correct
18 Correct 17 ms 2896 KB Output is correct
19 Correct 17 ms 2900 KB Output is correct
20 Correct 3 ms 848 KB Output is correct
21 Correct 3 ms 848 KB Output is correct
22 Correct 4 ms 848 KB Output is correct
23 Correct 14 ms 3064 KB Output is correct
24 Correct 16 ms 2896 KB Output is correct
25 Correct 14 ms 2896 KB Output is correct
26 Correct 11 ms 2640 KB Output is correct
27 Correct 12 ms 2896 KB Output is correct
28 Correct 12 ms 2896 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 309 ms 112480 KB Output is correct
36 Correct 319 ms 112712 KB Output is correct
37 Correct 291 ms 113480 KB Output is correct
38 Correct 309 ms 113224 KB Output is correct
39 Correct 280 ms 113004 KB Output is correct
40 Correct 3 ms 848 KB Output is correct
41 Correct 3 ms 848 KB Output is correct
42 Correct 3 ms 1016 KB Output is correct
43 Correct 300 ms 113548 KB Output is correct
44 Correct 261 ms 113480 KB Output is correct
45 Correct 258 ms 113224 KB Output is correct
46 Correct 269 ms 110408 KB Output is correct
47 Correct 287 ms 110156 KB Output is correct
48 Correct 285 ms 108688 KB Output is correct
49 Incorrect 2 ms 592 KB Output isn't correct
50 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 14 ms 2896 KB Output is correct
5 Correct 2 ms 592 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 16 ms 2996 KB Output is correct
12 Correct 8 ms 2896 KB Output is correct
13 Correct 17 ms 2896 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 592 KB Output is correct
16 Correct 19 ms 2896 KB Output is correct
17 Correct 16 ms 2896 KB Output is correct
18 Correct 17 ms 2896 KB Output is correct
19 Correct 17 ms 2900 KB Output is correct
20 Correct 3 ms 848 KB Output is correct
21 Correct 3 ms 848 KB Output is correct
22 Correct 4 ms 848 KB Output is correct
23 Correct 14 ms 3064 KB Output is correct
24 Correct 16 ms 2896 KB Output is correct
25 Correct 14 ms 2896 KB Output is correct
26 Correct 11 ms 2640 KB Output is correct
27 Correct 12 ms 2896 KB Output is correct
28 Correct 12 ms 2896 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 309 ms 112480 KB Output is correct
36 Correct 319 ms 112712 KB Output is correct
37 Correct 291 ms 113480 KB Output is correct
38 Correct 309 ms 113224 KB Output is correct
39 Correct 280 ms 113004 KB Output is correct
40 Correct 3 ms 848 KB Output is correct
41 Correct 3 ms 848 KB Output is correct
42 Correct 3 ms 1016 KB Output is correct
43 Correct 300 ms 113548 KB Output is correct
44 Correct 261 ms 113480 KB Output is correct
45 Correct 258 ms 113224 KB Output is correct
46 Correct 269 ms 110408 KB Output is correct
47 Correct 287 ms 110156 KB Output is correct
48 Correct 285 ms 108688 KB Output is correct
49 Correct 316 ms 113392 KB Output is correct
50 Correct 310 ms 113224 KB Output is correct
51 Correct 325 ms 113224 KB Output is correct
52 Correct 315 ms 113224 KB Output is correct
53 Correct 339 ms 113736 KB Output is correct
54 Correct 4 ms 848 KB Output is correct
55 Correct 4 ms 848 KB Output is correct
56 Correct 4 ms 848 KB Output is correct
57 Correct 285 ms 113928 KB Output is correct
58 Correct 317 ms 113984 KB Output is correct
59 Correct 286 ms 113996 KB Output is correct
60 Correct 305 ms 110972 KB Output is correct
61 Correct 305 ms 111176 KB Output is correct
62 Correct 292 ms 111688 KB Output is correct
63 Incorrect 2 ms 592 KB Output isn't correct
64 Halted 0 ms 0 KB -