結果

問題 No.5011 Better Mo's Algorithm is Needed!! (Weighted)
ユーザー snukesnuke
提出日時 2022-12-17 11:01:17
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 153 ms / 5,000 ms
コード長 3,269 bytes
コンパイル時間 5,012 ms
実行使用メモリ 9,004 KB
スコア 128,843,782
最終ジャッジ日時 2022-12-17 11:02:29
合計ジャッジ時間 67,670 ms
ジャッジサーバーID
(参考情報)
judge14 / judge10
純コード判定しない問題か言語
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 146 ms
8,928 KB
testcase_01 AC 148 ms
8,956 KB
testcase_02 AC 145 ms
8,896 KB
testcase_03 AC 147 ms
8,948 KB
testcase_04 AC 145 ms
8,976 KB
testcase_05 AC 152 ms
8,924 KB
testcase_06 AC 149 ms
8,892 KB
testcase_07 AC 142 ms
8,924 KB
testcase_08 AC 149 ms
8,812 KB
testcase_09 AC 151 ms
8,888 KB
testcase_10 AC 150 ms
8,972 KB
testcase_11 AC 151 ms
8,956 KB
testcase_12 AC 150 ms
8,992 KB
testcase_13 AC 143 ms
8,884 KB
testcase_14 AC 144 ms
8,824 KB
testcase_15 AC 148 ms
8,996 KB
testcase_16 AC 143 ms
8,892 KB
testcase_17 AC 145 ms
8,924 KB
testcase_18 AC 150 ms
8,968 KB
testcase_19 AC 146 ms
8,896 KB
testcase_20 AC 144 ms
8,820 KB
testcase_21 AC 145 ms
8,948 KB
testcase_22 AC 145 ms
8,812 KB
testcase_23 AC 146 ms
8,816 KB
testcase_24 AC 150 ms
8,904 KB
testcase_25 AC 144 ms
8,932 KB
testcase_26 AC 146 ms
8,892 KB
testcase_27 AC 145 ms
8,960 KB
testcase_28 AC 145 ms
8,816 KB
testcase_29 AC 143 ms
8,972 KB
testcase_30 AC 146 ms
8,920 KB
testcase_31 AC 141 ms
8,820 KB
testcase_32 AC 145 ms
8,928 KB
testcase_33 AC 147 ms
8,924 KB
testcase_34 AC 143 ms
8,972 KB
testcase_35 AC 149 ms
8,820 KB
testcase_36 AC 146 ms
8,820 KB
testcase_37 AC 144 ms
8,956 KB
testcase_38 AC 149 ms
8,820 KB
testcase_39 AC 150 ms
8,820 KB
testcase_40 AC 150 ms
8,948 KB
testcase_41 AC 150 ms
8,984 KB
testcase_42 AC 149 ms
8,964 KB
testcase_43 AC 147 ms
8,812 KB
testcase_44 AC 142 ms
8,896 KB
testcase_45 AC 145 ms
8,964 KB
testcase_46 AC 145 ms
8,968 KB
testcase_47 AC 146 ms
8,816 KB
testcase_48 AC 153 ms
8,896 KB
testcase_49 AC 145 ms
8,964 KB
testcase_50 AC 146 ms
8,936 KB
testcase_51 AC 147 ms
8,956 KB
testcase_52 AC 143 ms
8,952 KB
testcase_53 AC 145 ms
8,956 KB
testcase_54 AC 148 ms
8,924 KB
testcase_55 AC 143 ms
8,820 KB
testcase_56 AC 145 ms
8,920 KB
testcase_57 AC 152 ms
8,964 KB
testcase_58 AC 145 ms
8,888 KB
testcase_59 AC 145 ms
8,896 KB
testcase_60 AC 149 ms
8,900 KB
testcase_61 AC 147 ms
8,968 KB
testcase_62 AC 150 ms
8,896 KB
testcase_63 AC 150 ms
8,820 KB
testcase_64 AC 151 ms
8,964 KB
testcase_65 AC 148 ms
8,968 KB
testcase_66 AC 144 ms
8,896 KB
testcase_67 AC 146 ms
8,900 KB
testcase_68 AC 148 ms
8,928 KB
testcase_69 AC 151 ms
8,972 KB
testcase_70 AC 144 ms
8,936 KB
testcase_71 AC 148 ms
8,936 KB
testcase_72 AC 147 ms
8,956 KB
testcase_73 AC 145 ms
8,964 KB
testcase_74 AC 151 ms
8,940 KB
testcase_75 AC 151 ms
8,968 KB
testcase_76 AC 150 ms
9,004 KB
testcase_77 AC 147 ms
8,896 KB
testcase_78 AC 145 ms
8,820 KB
testcase_79 AC 144 ms
8,884 KB
testcase_80 AC 145 ms
8,888 KB
testcase_81 AC 146 ms
8,936 KB
testcase_82 AC 147 ms
8,952 KB
testcase_83 AC 152 ms
8,920 KB
testcase_84 AC 151 ms
8,960 KB
testcase_85 AC 149 ms
8,816 KB
testcase_86 AC 149 ms
8,820 KB
testcase_87 AC 150 ms
8,960 KB
testcase_88 AC 149 ms
8,820 KB
testcase_89 AC 149 ms
8,964 KB
testcase_90 AC 143 ms
8,892 KB
testcase_91 AC 147 ms
8,816 KB
testcase_92 AC 144 ms
8,900 KB
testcase_93 AC 147 ms
8,932 KB
testcase_94 AC 146 ms
8,964 KB
testcase_95 AC 147 ms
8,820 KB
testcase_96 AC 149 ms
8,952 KB
testcase_97 AC 150 ms
8,996 KB
testcase_98 AC 150 ms
8,920 KB
testcase_99 AC 150 ms
8,912 KB
testcase_100 AC 145 ms
8,932 KB
testcase_101 AC 147 ms
8,932 KB
testcase_102 AC 145 ms
8,960 KB
testcase_103 AC 144 ms
8,968 KB
testcase_104 AC 143 ms
8,960 KB
testcase_105 AC 152 ms
8,816 KB
testcase_106 AC 152 ms
8,820 KB
testcase_107 AC 147 ms
8,924 KB
testcase_108 AC 148 ms
8,968 KB
testcase_109 AC 144 ms
8,940 KB
testcase_110 AC 149 ms
8,896 KB
testcase_111 AC 147 ms
8,824 KB
testcase_112 AC 144 ms
8,956 KB
testcase_113 AC 147 ms
8,824 KB
testcase_114 AC 152 ms
8,956 KB
testcase_115 AC 148 ms
8,952 KB
testcase_116 AC 148 ms
8,820 KB
testcase_117 AC 146 ms
8,924 KB
testcase_118 AC 145 ms
8,888 KB
testcase_119 AC 147 ms
8,952 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>;
int geti(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<typename T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<typename T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<typename T>void operator+=(vc<T>&a,T b){for(T&x:a)x+=b;}
template<typename T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const vv<T>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<typename T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("Yes"); return;}
#define no { puts("No"); return;}
#define ret(x) { cout<<(x)<<endl; return;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

struct Solver {
  void solve() {
    int n,q,wt,st;
    scanf("%d%d%d%d",&n,&q,&wt,&st);
    vi w(n);
    cin>>w;
    vp p(q);
    cin>>p;
    vi a = pm(q);

    a++;
    cout<<a<<endl;
  }
};

int main() {
  // cin.tie(nullptr); ios::sync_with_stdio(false);
  int ts = 1;
  // scanf("%d",&ts);
  rep1(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}
0