oj.uz

Submission #476720

# Submission time Handle Problem Language Result Execution time Memory
476720 2021-09-28T10:25:14 Z pluto_ish Fancy Fence (CEOI20_fancyfence) C++14
100 / 100
 77 ms 10072 KB 
#include <bits/stdc++.h>
 
#define pb push_back
#define ff first
#define ss second
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
const ll INF = (ll)1<<62;
const ll MOD = 1e9+7;
const int iINF = 1<<30;
const double PI = 3.14159265359;

ll nC2(ll n){
  if(n < 0) return 0;
  return (n*(n-1)/2) % MOD;
}  

void solve(){
  int n;
  cin >> n;

  vector<ll> h(n), w(n);
  for(ll& x : h) cin >> x;
  for(ll& x : w) cin >> x;

  map<ll, ll> mp;
  ll s = 0, ans = 0;
  for(int i=0;i<n;i++){
    auto it = mp.upper_bound(h[i]);
    for(;it!=mp.end();){
      s = (s - nC2(it->ff+1)*it->ss + MOD)%MOD;
      s = (s + nC2(h[i]+1)*it->ss + MOD)%MOD;

      mp[h[i]] = (mp[h[i]] + it->ss)%MOD;
      it = mp.erase(it);
    }  
    
    ans = (ans + nC2(h[i]+1)*nC2(w[i]+1)%MOD + s*w[i]%MOD)%MOD;
    s = (s + nC2(h[i]+1)*w[i]%MOD)%MOD;
    mp[h[i]] = (mp[h[i]] + w[i])%MOD;
  }  
  cout << ans << "\n";
}

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);

  int t = 1;
  //cin >> t;
  while(t--){
    solve();
  }  
  
  return 0;
}

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 248 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 11 ms 1612 KB Output is correct
4 Correct 19 ms 3032 KB Output is correct
5 Correct 26 ms 3024 KB Output is correct
6 Correct 20 ms 3024 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 14 ms 2124 KB Output is correct
4 Correct 28 ms 3804 KB Output is correct
5 Correct 29 ms 3932 KB Output is correct
6 Correct 0 ms 204 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 12 ms 1996 KB Output is correct
5 Correct 28 ms 3808 KB Output is correct
6 Correct 31 ms 3936 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 6 ms 1228 KB Output is correct
9 Correct 30 ms 3352 KB Output is correct
10 Correct 69 ms 9944 KB Output is correct
11 Correct 77 ms 9984 KB Output is correct
12 Correct 0 ms 316 KB Output is correct

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 204 KB Output is correct

Subtask #7
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 248 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 10 ms 1692 KB Output is correct
12 Correct 22 ms 3036 KB Output is correct
13 Correct 24 ms 3020 KB Output is correct
14 Correct 21 ms 3032 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 588 KB Output is correct
17 Correct 14 ms 2084 KB Output is correct
18 Correct 24 ms 3848 KB Output is correct
19 Correct 28 ms 4036 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 6 ms 1228 KB Output is correct
22 Correct 33 ms 3264 KB Output is correct
23 Correct 72 ms 9876 KB Output is correct
24 Correct 72 ms 10072 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 4 ms 588 KB Output is correct
31 Correct 4 ms 588 KB Output is correct
32 Correct 17 ms 1868 KB Output is correct
33 Correct 21 ms 2076 KB Output is correct
34 Correct 33 ms 3548 KB Output is correct
35 Correct 37 ms 3548 KB Output is correct
36 Correct 34 ms 3784 KB Output is correct
37 Correct 39 ms 3792 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 36 ms 3800 KB Output is correct
40 Correct 35 ms 3848 KB Output is correct
41 Correct 47 ms 4472 KB Output is correct
42 Correct 53 ms 6856 KB Output is correct