제출 #1029400

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1029400		yeediot	Flooding Wall (BOI24_wall)	C++17	70 / 100	1117 ms	131420 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#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...);}
#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, a[mxn], b[mxn], pw[mxn];
#define s seg[id]
#define L seg[seg[id].lc]
#define R seg[seg[id].rc]
struct node{
    int l, r, val, tag, lc, rc;
};
struct segment_tree{
    int tmr = 0;
    node seg[5 * mxn];
    void new_node(int l, int r){
        int id = ++tmr;
        s.l = l, s.r = r;
        s.val = s.r - s.l + 1;
        s.tag = 1;
        s.lc = s.rc = -1;
    }
    void push(int id){
        int mm = (long long) s.l + s.r >> 1;
        if(s.lc == -1){
            new_node(s.l, mm);
            s.lc = tmr;
        }
        if(s.rc == -1){
            new_node(mm + 1, s.r);
            s.rc = tmr;
        }
        L.tag = (long long)L.tag * s.tag % mod;
        R.tag = (long long)R.tag * s.tag % mod;
        L.val = (long long)L.val * s.tag % mod;
        R.val = (long long)R.val * s.tag % mod;
        s.tag = 1;
    }
    void merge(int id){
        s.val = ((long long)L.val + R.val) % mod;
    }
    void modify(int id, int ql, int qr, int v){
        if(qr < s.l or s.r < ql) return;
        if(ql <= s.l and s.r <= qr){
            //debug(id, s.val, s.l, s.r, v, ql, qr);
            s.val = (long long)s.val * v % mod;
            s.tag = (long long)s.tag * v % mod;
            //debug(id, s.val, s.l, s.r, v);
            return;
        }
        push(id);
        int mm = (long long) s.l + s.r >> 1;
        modify(s.lc, ql, qr, v);
        modify(s.rc, ql, qr, v);
        merge(id);
    }
};
void solve(){
    cin >> n;
    pw[0] = 1;
    for(int i = 1; i <= n; i++){
        pw[i] = pw[i - 1] * 2 % mod;
    }
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    for(int i = 1; i <= n; i++){
        cin >> b[i];
        if(a[i] > b[i]) swap(a[i], b[i]);
    }
    int ans = 0;
    segment_tree t1;
    t1.new_node(1, mod);
    for(int i = 1; i <= n; i++){
        t1.modify(1, 1, a[i], 0);
        t1.modify(1, b[i] + 1, mod, 2);
        ans = ((long long)ans - (long long)t1.seg[1].val * pw[n - i] % mod) % mod;
    }
    t1.tmr = 0;
    t1.new_node(1, mod);
    for(int i = n; i >= 1; i--){
        t1.modify(1, 1, a[i], 0);
        t1.modify(1, b[i] + 1, mod, 2);
        ans = ((long long)ans - (long long)t1.seg[1].val * pw[i - 1] % mod) % mod;
    }
    ans = ((long long)ans + (long long)n * t1.seg[1].val % mod);
    for(int i = 1; i <= n; i++){
        ans = ((long long)ans + pw[n - 1] * ((long long)b[i] - a[i] + (mod - b[i]) * 2LL % mod)) % mod;
    }
    if(ans < 0) ans += mod;
    cout << ans << '\n';
}
signed main(){
    TOI_is_so_de;
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    #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

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In member function 'void segment_tree::push(int)':
Main.cpp:64:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   64 |         int mm = (long long) s.l + s.r >> 1;
      |                  ~~~~~~~~~~~~~~~~^~~~~
Main.cpp: In member function 'void segment_tree::modify(int, int, int, int)':
Main.cpp:92:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   92 |         int mm = (long long) s.l + s.r >> 1;
      |                  ~~~~~~~~~~~~~~~~^~~~~
Main.cpp:92:13: warning: unused variable 'mm' [-Wunused-variable]
   92 |         int mm = (long long) s.l + s.r >> 1;
      |             ^~

• Subtask 1: 8 / 8
• Subtask 2: 17 / 17
• Subtask 3: 19 / 19
• Subtask 4: 14 / 14
• Subtask 5: 12 / 12
• Subtask 6: 0 / 30