oj.uz

Submission #200814

# Submission time Handle Problem Language Result Execution time Memory
200814 2020-02-08T08:31:58 Z balbit Soccer (JOI17_soccer) C++14
35 / 100
 40 ms 2548 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long

#define int ll
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define FOR(i,a,b) for (int i=(a); i<(b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i=(n-1); i>=0; --i)
#define REP1(i,n) FOR(i,1,n+1)
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1<<29;
const ll inf = 1ll<<60;
const ll mod = 1e9+7;


void GG(){cout<<"-1\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b){
    return b==1?1:(mod-mod/b) * inv(mod%b) % mod;
}

const int maxn = 1005;

int n, m;
ll A,B,C;
ll d[maxn];
int r[maxn],c[maxn];

signed main(){
    IOS();
    cin>>n>>m;
    cin>>A>>B>>C;
    int N; cin>>N;
    REP(i,N){
        cin>>r[i]>>c[i];
    }
    priority_queue<pii, vector<pii>, greater<pii> > pq;
    pq.push({0,0});
    fill(d, d+maxn, inf);
    d[0]=0;
    while (!pq.empty()){
        int v = pq.top().s; ll w = pq.top().f;pq.pop();
        if (d[v]!=w) continue;
        REP(i,N){
            if (i!=v){
                ll dto = 0;
                ll d1 = abs(r[i]-r[v]), d2 = abs(c[i]-c[v]);
                dto = min({C*d1+C*d2,C*d1+ B+A*d2,B+A*d1 +C*d2});
                if (d[i]>d[v]+dto){
                    d[i]=d[v]+dto;
                    pq.push({d[i],i});
                }
            }
        }
    }
//    bug(d[1]);
    cout<<d[N-1]<<endl;
    // Check your array bounds!
    // Think about corner cases (smallest or biggest?)
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 40 ms 2544 KB Output is correct
7 Correct 11 ms 504 KB Output is correct
8 Correct 12 ms 760 KB Output is correct
9 Correct 10 ms 504 KB Output is correct
10 Correct 10 ms 504 KB Output is correct
11 Correct 11 ms 632 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 30 ms 2548 KB Output is correct
14 Correct 10 ms 504 KB Output is correct
15 Correct 10 ms 632 KB Output is correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 40 ms 2544 KB Output is correct
12 Correct 11 ms 504 KB Output is correct
13 Correct 12 ms 760 KB Output is correct
14 Correct 10 ms 504 KB Output is correct
15 Correct 10 ms 504 KB Output is correct
16 Correct 11 ms 632 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 30 ms 2548 KB Output is correct
19 Correct 10 ms 504 KB Output is correct
20 Correct 10 ms 632 KB Output is correct
21 Correct 5 ms 396 KB Output is correct
22 Incorrect 5 ms 376 KB Output isn't correct
23 Halted 0 ms 0 KB -