oj.uz

Submission #1007600

# Submission time Handle Problem Language Result Execution time Memory
1007600 2024-06-25T08:57:53 Z dimashhh Soccer (JOI17_soccer) C++17
5 / 100
 673 ms 116988 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
const int  N = 5e2 + 2, MOD = (int)1e9 + 7;
const int dx[] = {1,0,-1,0},dy[] = {0,1,0,-1};
int n,m,d[N][N];
ll val[N][N];
ll a,b,c;
queue<pair<int,int>> q;
bool check(int x,int y){
    return (x >= 1 && x <= n && y >= 1 && y <= m);
}
queue<pair<ll,pair<int,int>>> st;
int fx,fy;
ll dist[N][N];
bool vis[N][N];
void test(){
    cin >> n >> m >> a >> b >> c;
    n++;
    m++;
    int f;cin >> f;
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= m;j++){
            d[i][j] = 1e9;
            dist[i][j] = 1e17;
        }
    }
    for(int i = 1;i <= f;i++) {
        int s,t;
        cin >> s >> t;
        s++;
        t++;
        if(i == 1){
            dist[s][t] = 0;
            st.push({0,{s,t}});
        }
        d[s][t] = 0;
        q.push({s,t});
        fx = s;fy = t;
    }
    while(!q.empty()){
        auto [x,y] = q.front();q.pop();
        val[x][y] = d[x][y] * c;
        for(int i = 0;i < 4;i++){
            int x1 = x + dx[i],y1 = y + dy[i];
            if(check(x1,y1) && d[x1][y1] > d[x][y] + 1){
                d[x1][y1] = d[x][y] +1;
                q.push({x1,y1});
            }
        }
    }
    while(!st.empty()){
        auto [d,t] = (st.front());
        st.pop();
        int x = t.first,y = t.second;
        if(vis[x][y]) continue;
        vis[x][y] = 1;
        vector<pair<ll,pair<int,int>>> ad;
        for(int x1 = 1;x1 <= n;x1++) {
            ll dd = min(abs(x - x1) * 1ll * c + dist[x][y],
                        dist[x][y] + val[x1][y] + abs(x1 - x) * a + (x1 != x ? b : 0));
            if (dd < dist[x1][y]) {
                dist[x1][y] = dd;
                ad.push_back({dist[x1][y], {x1, y}});
            }
        }
        for(int y1 = m;y1 >= 1;y1--) {
            ll dd = min(abs(y - y1) * 1ll * c + dist[x][y],
                        dist[x][y] + val[x][y1] + abs(y - y1) * a + (y1 != y ? b : 0));
            if (dd < dist[x][y1]) {
                dist[x][y1] = dd;
                ad.push_back({dist[x][y1], {x, y1}});
            }
        }
        sort(ad.begin(),ad.end());
        for(auto df:ad){
            st.push(df);
        }
    }
    cout << dist[fx][fy];
}
int main() {
    ios_base::sync_with_stdio(false);cin.tie(0);
    int t = 1;
    // cin >> t;
    while(t--){
        test();
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 19428 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 673 ms 116988 KB Output is correct
4 Correct 640 ms 68096 KB Output is correct
5 Correct 125 ms 6744 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 582 ms 23048 KB Output is correct
2 Correct 639 ms 22664 KB Output is correct
3 Correct 454 ms 42080 KB Output is correct
4 Correct 656 ms 68472 KB Output is correct
5 Incorrect 474 ms 22792 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 19428 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 673 ms 116988 KB Output is correct
4 Correct 640 ms 68096 KB Output is correct
5 Correct 125 ms 6744 KB Output is correct
6 Correct 582 ms 23048 KB Output is correct
7 Correct 639 ms 22664 KB Output is correct
8 Correct 454 ms 42080 KB Output is correct
9 Correct 656 ms 68472 KB Output is correct
10 Incorrect 474 ms 22792 KB Output isn't correct
11 Halted 0 ms 0 KB -