結果

問題 No.1347 HS Railway
ユーザー blackyukiblackyuki
提出日時 2021-01-15 16:46:52
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 4,124 bytes
コンパイル時間 3,669 ms
コンパイル使用メモリ 231,752 KB
実行使用メモリ 8,192 KB
最終ジャッジ日時 2024-05-05 01:56:32
合計ジャッジ時間 13,983 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 RE -
testcase_02 RE -
testcase_03 RE -
testcase_04 RE -
testcase_05 RE -
testcase_06 RE -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 RE -
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 RE -
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
testcase_32 RE -
testcase_33 RE -
testcase_34 RE -
testcase_35 RE -
testcase_36 RE -
testcase_37 RE -
testcase_38 RE -
testcase_39 RE -
testcase_40 RE -
testcase_41 RE -
testcase_42 RE -
testcase_43 RE -
testcase_44 RE -
testcase_45 RE -
testcase_46 RE -
testcase_47 RE -
testcase_48 RE -
testcase_49 RE -
testcase_50 RE -
testcase_51 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=998244353;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
inline ll readll() {
    ll x = 0;
    char ch = getchar_unlocked();
    while (ch < '0' || ch > '9') ch = getchar_unlocked();
    while (ch >= '0' && ch <= '9'){
		x = (x << 3) + (x << 1) + ch - '0';
		ch = getchar_unlocked();
	}
    return x;
}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
int main(){
    ll n;cin>>n;
    assert(1<=n&&n<=200000);
    vvi v(5,vi(n-1));
    rep(i,5)rep(j,n-1)cin>>v[i][j];
    rep(i,4)rep(j,n-1)assert(v[i][j]<v[i+1][j]);
    vp range(5);
    rep(i,5){
        cin>>range[i].fi>>range[i].se;
        assert(1<=range[i].fi&&range[i].fi<=n);
        assert(1<=range[i].se&&range[i].se<=n);
        range[i].fi--;range[i].se--;
    }
    vvi rui(5,vi(n));
    rep(i,5)rep(j,n-1)rui[i][j+1]=rui[i][j]+v[i][j];
    auto len=[&](ll num,ll a,ll b){
        return rui[num][b]-rui[num][a];
    };
    ll m;cin>>m;
    assert(1<=m&&m<=30000);
    vvi train(5);
    rep(i,m){
        ll b,s;cin>>b>>s;
        assert(1<=b&&b<=5);assert(1<=s&&s<=100000);
        train[b-1].pb(s);
    }
    rep(i,5)sort(all(train[i]));
    ll ans=0;
    rep(a,5)REP(b,a+1,5){
        ll mi=max(range[a].fi,range[b].fi),ma=min(range[a].se,range[b].se);
        if(mi>ma)continue;
        ll ta=len(a,range[a].fi,mi),tb=len(b,range[b].fi,mi);
        ll A=len(a,mi,ma),B=len(b,mi,ma);
        vi l(train[b].size()),r(train[b].size());
        ll c=0;
        rep(i,train[b].size()){
            while(c<train[a].size()&&train[a][c]<train[b][i]+tb-ta)c++;
            l[i]=c;
        }
        c=0;
        rep(i,train[b].size()){
            while(c<train[a].size()&&train[a][c]<=train[b][i]+tb-ta+B-A)c++;
            r[i]=c;
        }
        rep(i,train[b].size())ans+=r[i]-l[i];
    }
    out(ans);
}
0