結果

問題 No.1347 HS Railway
ユーザー rniyarniya
提出日時 2021-01-17 12:57:38
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,718 bytes
コンパイル時間 2,492 ms
コンパイル使用メモリ 211,160 KB
実行使用メモリ 5,952 KB
最終ジャッジ日時 2023-08-19 18:29:05
合計ジャッジ時間 8,339 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 2 ms
4,380 KB
testcase_09 AC 2 ms
4,384 KB
testcase_10 AC 2 ms
4,380 KB
testcase_11 AC 2 ms
4,380 KB
testcase_12 AC 17 ms
4,928 KB
testcase_13 AC 13 ms
4,376 KB
testcase_14 AC 7 ms
4,380 KB
testcase_15 AC 11 ms
4,836 KB
testcase_16 AC 20 ms
4,380 KB
testcase_17 AC 5 ms
4,380 KB
testcase_18 AC 32 ms
5,684 KB
testcase_19 AC 29 ms
4,572 KB
testcase_20 AC 26 ms
5,152 KB
testcase_21 AC 12 ms
4,620 KB
testcase_22 AC 33 ms
5,348 KB
testcase_23 AC 30 ms
4,432 KB
testcase_24 AC 13 ms
4,380 KB
testcase_25 AC 21 ms
4,576 KB
testcase_26 AC 31 ms
5,004 KB
testcase_27 AC 20 ms
5,140 KB
testcase_28 AC 33 ms
5,436 KB
testcase_29 AC 33 ms
5,384 KB
testcase_30 AC 29 ms
5,544 KB
testcase_31 AC 27 ms
5,468 KB
testcase_32 AC 38 ms
5,940 KB
testcase_33 WA -
testcase_34 AC 41 ms
5,952 KB
testcase_35 WA -
testcase_36 AC 41 ms
5,916 KB
testcase_37 AC 44 ms
5,824 KB
testcase_38 AC 43 ms
5,932 KB
testcase_39 AC 46 ms
5,952 KB
testcase_40 AC 36 ms
5,864 KB
testcase_41 AC 36 ms
5,856 KB
testcase_42 AC 55 ms
5,892 KB
testcase_43 AC 40 ms
5,836 KB
testcase_44 AC 44 ms
5,856 KB
testcase_45 AC 41 ms
5,952 KB
testcase_46 AC 46 ms
5,940 KB
testcase_47 AC 51 ms
5,824 KB
testcase_48 AC 58 ms
5,940 KB
testcase_49 AC 48 ms
5,932 KB
testcase_50 AC 55 ms
5,944 KB
testcase_51 AC 48 ms
5,824 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
const long long MOD=1000000007;
// const long long MOD=998244353;
#define LOCAL
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(),(x).end()
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};

template<typename T>
istream &operator>>(istream &is,vector<T> &v){
    for (T &x:v) is >> x;
    return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template<typename T,typename U,typename V>
ostream&operator<<(ostream &os,const tuple<T,U,V> &t){
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template<typename T,typename U,typename V,typename W>
ostream&operator<<(ostream &os,const tuple<T,U,V,W> &t){
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const unordered_map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const multiset<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const unordered_set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const deque<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}

void debug_out(){cerr << '\n';}
template<class Head,class... Tail>
void debug_out(Head&& head,Tail&&... tail){
    cerr << head;
    if (sizeof...(Tail)>0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) cerr << " ";\
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\
cerr << " ";\
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}
template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}

template<class T1,class T2> inline bool chmin(T1 &a,T2 b){
    if (a>b){a=b; return true;} return false;
}
template<class T1,class T2> inline bool chmax(T1 &a,T2 b){
    if (a<b){a=b; return true;} return false;
}
#pragma endregion

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N; cin >> N;
    vector<int> L(5),R(5);
    vector<vector<int>> A(5,vector<int>(N,-1));
    for (int i=0;i<5;++i){
        cin >> L[i] >> R[i]; --L[i],--R[i];
        for (int j=L[i];j<R[i];++j) cin >> A[i][j];
    }
    int M; cin >> M;
    vector<vector<int>> S(5);
    for (int i=0;i<M;++i){
        int b,s; cin >> b >> s;
        S[--b].emplace_back(s);
    }

    for (int i=0;i<5;++i) sort(S[i].begin(),S[i].end());

    ll ans=0;
    auto solve=[&](int x,int y)->ll{
        int l=max(L[x],L[y]),r=min(R[x],R[y]);
        if (r<l) return 0;
        ll sumx=0,sumy=0,tx=0,ty=0;
        for (int i=L[x];i<l;++i) sumx+=A[x][i];
        for (int i=l;i<r;++i) tx+=A[x][i];
        for (int i=L[y];i<l;++i) sumy+=A[y][i];
        for (int i=l;i<r;++i) ty+=A[y][i];

        vector<ll> X;
        for (int t:S[x]) X.emplace_back(t+sumx);

        ll res=0;
        for (int t:S[y]){
            t+=sumy;
            res+=upper_bound(X.begin(),X.end(),t+(ty-tx))-lower_bound(X.begin(),X.end(),t);
        }
        return res;
    };

    for (int i=0;i<5;++i){
        for (int j=i+1;j<5;++j){
            ans+=solve(i,j);
        }
    }

    cout << ans << '\n';
}
0