Submission #4011050


Source Code Expand

Copy
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(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 maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

    // 整数スキャン(複数)
    /*
    int x;
    scanf("%d",&x);
    int y;
    scanf("%d",&y);
    int z;
    scanf("%d",&z);

    // n個の整数のスキャン
    /*
    ll a[n] = {};
    rep(i,n){
        scanf("%lld",&a[i]);
    }
    */

    // 文字列スキャン
    /*
    string s;
    cin >> s;
    */

    // n個の文字列スキャン
    /*
    vector<string> slist;
    rep(i,n){
        string s;
        cin >> s;
        slist.push_back(s);
    }
    */

int main() {
    int n;
    scanf("%d",&n);
    ll d;
    scanf("%lld",&d);
    ll a[n] = {};
    rep(i,n){
        scanf("%lld",&a[i]);
    }
    ll b[n] = {};
    int nn = 0;
    int m = a[0];
    ll ans = 0;
    while(nn<n-1){
        int nnn = nn;
        ll mm = 9999999999999;
        srep(i,nnn+1,n){
            ll ii = abs(i-nnn)*d+a[i];
            if(ii<mm){
                mm = ii;
                nn = i;
            }
        }
        srep(i,nnn+1,nn){
            ans+=min(abs(i-nnn)*d+a[nnn]+a[i],abs(i-nn)*d+a[nn]+a[i]);
        }
        ans+=abs(nn-nnn)*d+a[nnn]+a[nn];
        //cout << nnn << nn << endl;

        srep(i,nnn,nn+1){
            mins(a[nn],a[i]+(nn-i)*d);
        }

    }   
    cout << ans << endl;
    return 0;
}
 
 

Submission Info

Submission Time
Task E - Connecting Cities
User Shibuyap
Language C++14 (GCC 5.4.1)
Score 0
Code Size 3382 Byte
Status
Exec Time 2104 ms
Memory 3328 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:89:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
./Main.cpp:91:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld",&d);
                     ^
./Main.cpp:94:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld",&a[i]);
                            ^

Judge Result

Set Name Score / Max Score Test Cases
Sample 0 / 0 s1.txt, s2.txt, s3.txt, s4.txt
All 0 / 600 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, s1.txt, s2.txt, s3.txt, s4.txt
Case Name Status Exec Time Memory
01.txt 90 ms 3328 KB
02.txt 114 ms 3328 KB
03.txt 107 ms 3328 KB
04.txt 89 ms 3328 KB
05.txt 85 ms 3328 KB
06.txt 37 ms 3328 KB
07.txt 28 ms 3328 KB
08.txt 40 ms 3328 KB
09.txt 33 ms 3328 KB
10.txt 34 ms 3328 KB
11.txt 2103 ms 3328 KB
12.txt 2103 ms 3328 KB
13.txt 2103 ms 3328 KB
14.txt 2103 ms 3328 KB
15.txt 2103 ms 3328 KB
16.txt 67 ms 3328 KB
17.txt 112 ms 3328 KB
18.txt 2103 ms 3328 KB
19.txt 2103 ms 3328 KB
20.txt 2103 ms 3328 KB
21.txt 2103 ms 3328 KB
22.txt 2104 ms 3328 KB
23.txt 2103 ms 3328 KB
24.txt 2103 ms 3328 KB
25.txt 2104 ms 3328 KB
26.txt 2103 ms 3328 KB
27.txt 2103 ms 3328 KB
28.txt 809 ms 3328 KB
29.txt 2103 ms 3328 KB
30.txt 2103 ms 3328 KB
s1.txt 1 ms 256 KB
s2.txt 1 ms 256 KB
s3.txt 1 ms 256 KB
s4.txt 1 ms 256 KB