oj.uz

Submission #1010594

# Submission time Handle Problem Language Result Execution time Memory
1010594 2024-06-29T08:24:23 Z yeediot Flooding Wall (BOI24_wall) C++17
70 / 100
 5000 ms 45676 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
#ifdef local
void CHECK();
void setio(){
    freopen("/Users/iantsai/cpp/input.txt","r",stdin);
    freopen("/Users/iantsai/cpp/output.txt","w",stdout);
}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
#define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio();
const int mxn = 5e5+5, mod = 1e9+7;
int n, l[mxn], r[mxn], f[mxn], inv[mxn], pre[mxn];
bool vis[mxn];
vector<pii>ord;
queue<int> to;
int fpow(int a, int b){
    int res = 1;
    while(b){
        if(b&1) res = res*a%mod;
        a=a*a%mod;
        b >>= 1;
    }
    return res;
}
/*struct BIT{
    int bit[mxn];
    void init(){
        for(int i=0;i<mxn;i++){
            bit[i] = 0;
        }
    }
    void modify(int p,int v){
        for(;p<mxn;p+=p&-p){
            bit[p] += v;
        }
    }
    int query(int p){
        int res = 0;
        for(;p;p-=p&-p){
            res += bit[p];
        }
        return res;
    }
}bt;*/
signed main(){
    TOI_is_so_de;
    cin >> n;
    f[0] = 1;
    inv[0] = 1;
    for(int i=1;i<=n;i++){
        f[i] = f[i-1] * 2 % mod;
        inv[i] = fpow(f[i], mod-2);
    }
    int val = f[n-1], ans = 0, mx = 2;
    vector<int>temp;
    for(int i=1;i<=n;i++){
        cin >> l[i];
        chmax(mx, l[i]);
        temp.pb(l[i]);
    }
    for(int i=1;i<=n;i++){
        cin >> r[i];
        chmax(mx, r[i]);
        temp.pb(r[i]);
    }
    sort(all(temp));
    temp.resize(unique(all(temp))-temp.begin());
    int last = 0;
    for(auto H : temp){
        ord.clear();
        for(int i=1;i<=n;i++){
            pre[i] = 0;
        }
        vector<int>pos;
        for(int i=1;i<=n;i++){
            if(l[i] >= H){
                pre[i]++;
            }
            else{
                ord.pb({1, i});
            }
            if(r[i] >= H){
                pre[i]++;
                if(l[i] >= H){
                    pos.pb(i);
                }
            }
            else{
                ord.pb({1, i});
            }
        }
        debug(H, pos, ord);
        for(int i=1;i<=n;i++){
            pre[i] += pre[i-1];
        }
        int prev = -1, ptr = 0;
        for(auto [h, id] : ord){
            while(ptr < sz(pos) and pos[ptr] < id){
                ptr++;
            }
            int temp = val;
            if(ptr == 0){
                int x = pre[id-1];
                int val2 = f[x];
                temp = temp * inv[x] % mod * (val2 - 1) % mod;
            }
            if(ptr==sz(pos)){
                int x = pre[n] - pre[id];
                int val2 = f[x];
                temp = temp * inv[x] % mod * (val2 - 1) % mod;
            }
            ans = (ans + (H - last) * temp % mod) % mod;
        }
        while(sz(to)){
            auto v = to.front();
            to.pop();
            vis[v] = 0;
        }
        last = H;
        debug(ans);
    }
    cout << ans << '\n';
    #ifdef local
    CHECK();
    #endif
}
/*
input:
 
*/
#ifdef local
void CHECK(){
    cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
     function<bool(string,string)> compareFiles = [](string p1, string p2)->bool {
         std::ifstream file1(p1);
         std::ifstream file2(p2);
         if (!file1.is_open() || !file2.is_open())return false;
         std::string line1, line2;
         while (getline(file1, line1) && getline(file2, line2)) {
             if (line1 != line2)return false;
         }
         int cnta=0,cntb=0;
         while(getline(file1,line1))cnta++;
         while(getline(file2,line2))cntb++;
         return cntb-cnta<=1;
     };
     bool check = compareFiles("output.txt","expected.txt");
     if (check) cerr<<"ACCEPTED\n";
     else cerr<<"WRONG ANSWER!\n";
}
#else
#endif

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:135:13: warning: unused variable 'prev' [-Wunused-variable]
  135 |         int prev = -1, ptr = 0;
      |             ^~~~
Main.cpp: In function 'void setIO(std::string)':
Main.cpp:35:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:36:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 432 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 352 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 460 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 460 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 155 ms 1728 KB Output is correct
28 Correct 145 ms 1620 KB Output is correct
29 Correct 4 ms 1428 KB Output is correct
30 Correct 3 ms 1428 KB Output is correct
31 Correct 5 ms 1528 KB Output is correct
32 Correct 5 ms 1744 KB Output is correct
33 Correct 6 ms 1524 KB Output is correct
34 Correct 5 ms 1792 KB Output is correct
35 Correct 5 ms 1776 KB Output is correct
36 Correct 8 ms 1552 KB Output is correct
37 Correct 3 ms 1424 KB Output is correct
38 Correct 3 ms 1428 KB Output is correct
39 Correct 6 ms 1532 KB Output is correct
40 Correct 5 ms 1764 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 432 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 352 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 460 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 155 ms 1728 KB Output is correct
50 Correct 145 ms 1620 KB Output is correct
51 Correct 4 ms 1428 KB Output is correct
52 Correct 3 ms 1428 KB Output is correct
53 Correct 5 ms 1528 KB Output is correct
54 Correct 5 ms 1744 KB Output is correct
55 Correct 6 ms 1524 KB Output is correct
56 Correct 5 ms 1792 KB Output is correct
57 Correct 5 ms 1776 KB Output is correct
58 Correct 8 ms 1552 KB Output is correct
59 Correct 3 ms 1424 KB Output is correct
60 Correct 3 ms 1428 KB Output is correct
61 Correct 6 ms 1532 KB Output is correct
62 Correct 5 ms 1764 KB Output is correct
63 Correct 2657 ms 1724 KB Output is correct
64 Correct 2645 ms 1900 KB Output is correct
65 Correct 5 ms 1796 KB Output is correct
66 Correct 6 ms 1552 KB Output is correct
67 Correct 6 ms 1812 KB Output is correct
68 Correct 6 ms 1524 KB Output is correct
69 Correct 1367 ms 1668 KB Output is correct
70 Correct 1381 ms 1788 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 1 ms 356 KB Output is correct
10 Correct 3 ms 1436 KB Output is correct
11 Correct 4 ms 1424 KB Output is correct
12 Correct 3 ms 1428 KB Output is correct
13 Correct 3 ms 1428 KB Output is correct
14 Correct 144 ms 41924 KB Output is correct
15 Correct 157 ms 42028 KB Output is correct
16 Correct 146 ms 41972 KB Output is correct
17 Correct 153 ms 41908 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 432 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 352 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 460 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 155 ms 1728 KB Output is correct
50 Correct 145 ms 1620 KB Output is correct
51 Correct 4 ms 1428 KB Output is correct
52 Correct 3 ms 1428 KB Output is correct
53 Correct 5 ms 1528 KB Output is correct
54 Correct 5 ms 1744 KB Output is correct
55 Correct 6 ms 1524 KB Output is correct
56 Correct 5 ms 1792 KB Output is correct
57 Correct 5 ms 1776 KB Output is correct
58 Correct 8 ms 1552 KB Output is correct
59 Correct 3 ms 1424 KB Output is correct
60 Correct 3 ms 1428 KB Output is correct
61 Correct 6 ms 1532 KB Output is correct
62 Correct 5 ms 1764 KB Output is correct
63 Correct 2657 ms 1724 KB Output is correct
64 Correct 2645 ms 1900 KB Output is correct
65 Correct 5 ms 1796 KB Output is correct
66 Correct 6 ms 1552 KB Output is correct
67 Correct 6 ms 1812 KB Output is correct
68 Correct 6 ms 1524 KB Output is correct
69 Correct 1367 ms 1668 KB Output is correct
70 Correct 1381 ms 1788 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 1 ms 348 KB Output is correct
73 Correct 0 ms 464 KB Output is correct
74 Correct 0 ms 348 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 0 ms 344 KB Output is correct
78 Correct 0 ms 352 KB Output is correct
79 Correct 1 ms 356 KB Output is correct
80 Correct 3 ms 1436 KB Output is correct
81 Correct 4 ms 1424 KB Output is correct
82 Correct 3 ms 1428 KB Output is correct
83 Correct 3 ms 1428 KB Output is correct
84 Correct 144 ms 41924 KB Output is correct
85 Correct 157 ms 42028 KB Output is correct
86 Correct 146 ms 41972 KB Output is correct
87 Correct 153 ms 41908 KB Output is correct
88 Execution timed out 5005 ms 45676 KB Time limit exceeded
89 Halted 0 ms 0 KB -