제출 #1030518

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1030518		PCTprobability	전선 연결 (IOI17_wiring)	C++17	100 / 100	48 ms	15816 KiB

wiring

#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(s) (s).begin(),(s).end()
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define FOR_(n) for (ll _ = 0; (_) < (ll)(n); ++(_))
#define FOR(i, n) for (ll i = 0; (i) < (ll)(n); ++(i))
#define se second
#define pb push_back
#define P pair<ll,ll>
#define PQminll priority_queue<ll, vector<ll>, greater<ll>>
#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>
#define PQminP priority_queue<P, vector<P>, greater<P>>
#define PQmaxP priority_queue<P,vector<P>,less<P>>
#define NP next_permutation
#define die(a) {cout<<a<<endl;return 0;}
#define dier(a) {return a;}
//const ll mod = 1000000009;
const ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.00000000001);
static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
#define FOR_R(i, n) for (ll i = (ll)(n)-1; (i) >= 0; --(i))
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a,const T b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a,const T b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
P hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;}
P Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});}
P Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});}
P Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});}
P Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});}
P Pgyaku(P a){ return hyou({a.se,a.fi});}

void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(15);
}
ll min_total_length(vector<int> r,vector<int> b){
  ll n=r.size(),m=b.size();
  vector<P> a;
  for(int i=0;i<n;i++) a.pb({r[i],0});
  for(int i=0;i<m;i++) a.pb({b[i],1});
  sor(a);
  vector<vector<ll>> c;
  vector<ll> now;
  now.pb(a[0].fi);
  ll id=a[0].se;
  for(int i=1;i<n+m;i++){
    if(a[i].se!=id){
      c.pb(now);
      now.clear();
      now.pb(a[i].fi);
      id^=1;
    }
    else{
      now.pb(a[i].fi);
    }
  }
  c.pb(now);
  vector<ll> dp(c[0].size()+1,inf);
  {
    ll sm=0;
    for(auto e:c[0]) sm+=c[0].back()-e;
    dp.back()=sm;
  }
  for(int i=1;i<c.size();i++){
    ll k=c[i].size();
    vector<ll> d(k+1);
    for(int j=0;j<k;j++) d[j+1]=d[j]+c[i][j]-c[i][0];
    vector<ll> d2(k+1);
    for(int j=0;j<k;j++) d2[j+1]=d2[j]+c[i][k-1]-c[i][k-1-j];
    for(int j=0;j<=k;j++) d[j]+=d2[k-j];
    vector<ll> dp2(k+1,inf);
    ll r=c[i][0]-c[i-1].back();
    /*
    for(ll j=0;j<=k;j++){
      for(ll l=0;l<dp.size();l++){
        chmin(dp2[k-j],d[j]+dp[l]+max(l,j)*r);
      }
    }*/
    //l <= j のケース -> dp[l] の prefix min が欲しい
    auto dp3=dp;
    while(dp3.size()<=k) dp3.pb(inf);
    for(int j=1;j<dp3.size();j++) chmin(dp3[j],dp3[j-1]);
    for(ll j=0;j<=k;j++) chmin(dp2[k-j],d[j]+dp3[j]+j*r);
    //l >= j のケース -> dp[l] + l*r の suffix min が欲しい
    auto dp4=dp;
    for(ll l=0;l<dp.size();l++) dp4[l]+=r*l;
    while(dp4.size()<=k) dp4.pb(inf);
    for(int j=ll(dp4.size())-2;j>=0;j--) chmin(dp4[j],dp4[j+1]);
    for(ll j=0;j<=k;j++) chmin(dp2[k-j],d[j]+dp4[j]);
    dp=dp2;
  }
  return dp[0];
}

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

wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:106:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |   for(int i=1;i<c.size();i++){
      |               ~^~~~~~~~~
wiring.cpp:123:21: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
  123 |     while(dp3.size()<=k) dp3.pb(inf);
      |           ~~~~~~~~~~^~~
wiring.cpp:124:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |     for(int j=1;j<dp3.size();j++) chmin(dp3[j],dp3[j-1]);
      |                 ~^~~~~~~~~~~
wiring.cpp:128:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |     for(ll l=0;l<dp.size();l++) dp4[l]+=r*l;
      |                ~^~~~~~~~~~
wiring.cpp:129:21: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
  129 |     while(dp4.size()<=k) dp4.pb(inf);
      |           ~~~~~~~~~~^~~

• Subtask 1: 7 / 7
• Subtask 2: 13 / 13
• Subtask 3: 10 / 10
• Subtask 4: 25 / 25
• Subtask 5: 45 / 45