結果
問題 | No.3097 Azuki Kurai |
ユーザー |
![]() |
提出日時 | 2025-04-06 17:39:22 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 993 ms / 4,000 ms |
コード長 | 15,144 bytes |
コンパイル時間 | 2,961 ms |
コンパイル使用メモリ | 220,844 KB |
実行使用メモリ | 9,576 KB |
最終ジャッジ日時 | 2025-04-06 17:39:47 |
合計ジャッジ時間 | 23,909 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 32 |
ソースコード
//#define _GLIBCXX_DEBUG //#pragma GCC target("avx2") //#pragma GCC optimize("O3") //#pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> using namespace std; #ifdef LOCAL #include <debug_print.hpp> #define OUT(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else #define OUT(...) (static_cast<void>(0)) #endif #define endl '\n' #define lfs cout<<fixed<<setprecision(15) #define ALL(a) (a).begin(),(a).end() #define ALLR(a) (a).rbegin(),(a).rend() #define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end()) #define spa << " " << #define fi first #define se second #define MP make_pair #define MT make_tuple #define PB push_back #define EB emplace_back #define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++) #define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--) namespace template_tute{ using ll = long long; using ld = long double; const ll MOD1 = 1e9+7; const ll MOD9 = 998244353; const ll INF = 4.1e18; using P = pair<ll, ll>; template<typename T> using PQ = priority_queue<T>; template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>; template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;} template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;} ll median(ll a,ll b, ll c){return a+b+c-max<ll>({a,b,c})-min<ll>({a,b,c});} void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;} void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;} void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;} template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} template<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);}; template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}}; template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;}; template<typename T>void debug(const vector<T>&v){debug(v,v.size());} template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());} template<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;} template<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop();}cout<<endl;} template<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop_front();}cout<<endl;} template<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;} template<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;} template<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;} template<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;} template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<" ";cout<<endl;} template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<"["<<z.first<<"]="<<z.second<<",";cout<<endl;} template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;} vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1}; template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);} template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));} template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << "(" << p.first << "," << p.second << ")";} template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){os<<"[";for(auto &z:v)os << z << ",";os<<"]"; return os;} template<typename T>void rearrange(vector<int>&ord, vector<T>&v){ auto tmp = v; for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]]; } template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){ rearrange(ord, head); rearrange(ord, tail...); } template<typename T> vector<int> ascend(const vector<T>&v){ vector<int>ord(v.size());iota(ord.begin(),ord.end(),0); sort(ord.begin(),ord.end(),[&](int i,int j){return make_pair(v[i],i)<make_pair(v[j],j);}); return ord; } template<typename T> vector<int> descend(const vector<T>&v){ vector<int>ord(v.size());iota(ord.begin(),ord.end(),0); sort(ord.begin(),ord.end(),[&](int i,int j){return make_pair(v[i],-i)>make_pair(v[j],-j);}); return ord; } template<typename T> vector<T> inv_perm(const vector<T>&ord){ vector<T>inv(ord.size()); for(int i=0;i<ord.size();i++)inv[ord[i]] = i; return inv; } ll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;} ll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;} ll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;} ll modulo(ll n,ll d){return (n%d+d)%d;}; template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());} template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());} template<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));}; template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());}; //mt19937 mt(chrono::steady_clock::now().time_since_epoch().count()); int popcount(ll x){return __builtin_popcountll(x);}; int poplow(ll x){return __builtin_ctzll(x);}; int pophigh(ll x){return 63 - __builtin_clzll(x);}; template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;}; template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;}; template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;}; template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;}; ll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;} ll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;} ll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;} std::ostream &operator<<(std::ostream &dest, __int128_t value) { std::ostream::sentry s(dest); if (s) { __uint128_t tmp = value < 0 ? -value : value; char buffer[128]; char *d = std::end(buffer); do { --d; *d = "0123456789"[tmp % 10]; tmp /= 10; } while (tmp != 0); if (value < 0) { --d; *d = '-'; } int len = std::end(buffer) - d; if (dest.rdbuf()->sputn(d, len) != len) { dest.setstate(std::ios_base::badbit); } } return dest; } namespace converter{ int dict[500]; const string lower="abcdefghijklmnopqrstuvwxyz"; const string upper="ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string digit="0123456789"; const string digit1="123456789"; void regi_str(const string &t){ for(int i=0;i<t.size();i++){ dict[t[i]]=i; } } void regi_int(const string &t){ for(int i=0;i<t.size();i++){ dict[i]=t[i]; } } vector<int>to_int(const string &s,const string &t){ regi_str(t); vector<int>ret(s.size()); for(int i=0;i<s.size();i++){ ret[i]=dict[s[i]]; } return ret; } vector<int>to_int(const string &s){ auto t=s; sort(t.begin(),t.end()); t.erase(unique(t.begin(),t.end()),t.end()); return to_int(s,t); } vector<vector<int>>to_int(const vector<string>&s,const string &t){ regi_str(t); vector<vector<int>>ret(s.size(),vector<int>(s[0].size())); for(int i=0;i<s.size();i++){ for(int j=0;j<s[0].size();j++){ ret[i][j]=dict[s[i][j]]; } } return ret; } vector<vector<int>>to_int(const vector<string>&s){ string t; for(int i=0;i<s.size();i++){ t+=s[i]; } sort(t.begin(),t.end());t.erase(unique(t.begin(),t.end()),t.end()); return to_int(s,t); } string to_str(const vector<int>&s,const string &t){ regi_int(t); string ret; for(auto z:s)ret+=dict[z]; return ret; } vector<string> to_str(const vector<vector<int>>&s,const string &t){ regi_int(t); vector<string>ret(s.size()); for(int i=0;i<s.size();i++){ for(auto z:s[i])ret[i]+=dict[z]; } return ret; } } template< typename T = int > struct edge { int to; T cost; int id; edge():to(-1),id(-1){}; edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){} operator int() const { return to; } }; template<typename T> using Graph = vector<vector<edge<T>>>; template<typename T> Graph<T>revgraph(const Graph<T> &g){ Graph<T>ret(g.size()); for(int i=0;i<g.size();i++){ for(auto e:g[i]){ int to = e.to; e.to = i; ret[to].push_back(e); } } return ret; } template<typename T> Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){ Graph<T> ret(n); for(int es = 0; es < m; es++){ int u,v; T w=1; cin>>u>>v;u-=indexed,v-=indexed; if(weighted)cin>>w; ret[u].emplace_back(v,w,es); if(!directed)ret[v].emplace_back(u,w,es); } return ret; } template<typename T> Graph<T> readParent(int n,int indexed=1,bool directed=true){ Graph<T>ret(n); for(int i=1;i<n;i++){ int p;cin>>p; p-=indexed; ret[p].emplace_back(i); if(!directed)ret[i].emplace_back(p); } return ret; } } using namespace template_tute; namespace atcoder { namespace internal { template <class T> struct simple_queue { std::vector<T> payload; int pos = 0; void reserve(int n) { payload.reserve(n); } int size() const { return int(payload.size()) - pos; } bool empty() const { return pos == int(payload.size()); } void push(const T& t) { payload.push_back(t); } T& front() { return payload[pos]; } void clear() { payload.clear(); pos = 0; } void pop() { pos++; } }; } // namespace internal } // namespace atcoder namespace atcoder { template <class Cap> struct mf_graph { public: mf_graph() : _n(0) {} mf_graph(int n) : _n(n), g(n) {} int add_edge(int from, int to, Cap cap) { assert(0 <= from && from < _n); assert(0 <= to && to < _n); assert(0 <= cap); int m = int(pos.size()); pos.push_back({from, int(g[from].size())}); g[from].push_back(_edge{to, int(g[to].size()), cap}); g[to].push_back(_edge{from, int(g[from].size()) - 1, 0}); return m; } struct edge { int from, to; Cap cap, flow; }; edge get_edge(int i) { int m = int(pos.size()); assert(0 <= i && i < m); auto _e = g[pos[i].first][pos[i].second]; auto _re = g[_e.to][_e.rev]; return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap}; } std::vector<edge> edges() { int m = int(pos.size()); std::vector<edge> result; for (int i = 0; i < m; i++) { result.push_back(get_edge(i)); } return result; } void change_edge(int i, Cap new_cap, Cap new_flow) { int m = int(pos.size()); assert(0 <= i && i < m); assert(0 <= new_flow && new_flow <= new_cap); auto& _e = g[pos[i].first][pos[i].second]; auto& _re = g[_e.to][_e.rev]; _e.cap = new_cap - new_flow; _re.cap = new_flow; } Cap flow(int s, int t) { return flow(s, t, std::numeric_limits<Cap>::max()); } Cap flow(int s, int t, Cap flow_limit) { assert(0 <= s && s < _n); assert(0 <= t && t < _n); std::vector<int> level(_n), iter(_n); internal::simple_queue<int> que; auto bfs = [&]() { std::fill(level.begin(), level.end(), -1); level[s] = 0; que.clear(); que.push(s); while (!que.empty()) { int v = que.front(); que.pop(); for (auto e : g[v]) { if (e.cap == 0 || level[e.to] >= 0) continue; level[e.to] = level[v] + 1; if (e.to == t) return; que.push(e.to); } } }; auto dfs = [&](auto self, int v, Cap up) { if (v == s) return up; Cap res = 0; int level_v = level[v]; for (int& i = iter[v]; i < int(g[v].size()); i++) { _edge& e = g[v][i]; if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue; Cap d = self(self, e.to, std::min(up - res, g[e.to][e.rev].cap)); if (d <= 0) continue; g[v][i].cap += d; g[e.to][e.rev].cap -= d; res += d; if (res == up) break; } return res; }; Cap flow = 0; while (flow < flow_limit) { bfs(); if (level[t] == -1) break; std::fill(iter.begin(), iter.end(), 0); while (flow < flow_limit) { Cap f = dfs(dfs, t, flow_limit - flow); if (!f) break; flow += f; } } return flow; } std::vector<bool> min_cut(int s) { std::vector<bool> visited(_n); internal::simple_queue<int> que; que.push(s); while (!que.empty()) { int p = que.front(); que.pop(); visited[p] = true; for (auto e : g[p]) { if (e.cap && !visited[e.to]) { visited[e.to] = true; que.push(e.to); } } } return visited; } private: int _n; struct _edge { int to, rev; Cap cap; }; std::vector<std::pair<int, int>> pos; std::vector<std::vector<_edge>> g; }; } void solve(){ ll res=0,buf=0; bool judge = true; ll n,m,k;cin>>n>>m>>k; vector<ll>a(n),b(m); rep(i,0,n)cin>>a[i]; rep(i,0,m)cin>>b[i],b[i]--; atcoder::mf_graph<ll>g((m+1)*n*2+2); ll S=n*(m+1)*2,T=n*(m+1)*2+1; rep(i,0,n){ g.add_edge(S,i,a[i]); } rep(i,0,m){ rep(j,0,n){ if(b[i]!=j)g.add_edge(2*i*n+j,2*i*n+j+n+n,INF); g.add_edge(2*i*n+j,2*i*n+j+n,k); if(b[i]!=(j+1)%n)g.add_edge(2*i*n+j+n,2*i*n+(j+1)%n+n+n,k); if(b[i]!=(j+n-1)%n)g.add_edge(2*i*n+j+n,2*i*n+(j+n-1)%n+n+n,k); } } vector<ll>ret(m+1); rrep(i,1,m+1){ rep(j,0,n)g.add_edge(2*i*n+j,T,INF); ret[i-1]=ret[i]+g.flow(S,T); } rep(i,0,m)cout<<ret[i]<<endl; } int main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); ll res=0,buf=0; bool judge = true; int T = 1; //cin>>T; while(T--){ solve(); } return 0; }