oj.uz

Submission #976571

# Submission time Handle Problem Language Result Execution time Memory
976571 2024-05-06T18:11:45 Z yeediot Soccer (JOI17_soccer) C++17
0 / 100
 7 ms 30300 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
const int N=505*505;
const int INF=1e18;
//int x[N], y[N], dis[N][N] ;//, dx[4]={0, 0, -1, 1}, dy[4]={-1, 1, 0, 0};//, dist[505][505][5];
int n, m, a, b, c, t;
bool valid(int i,int j){
    return (0<=i and i<=n and 0<=j and j<=m);
}
#define tiiii tuple<int,int,int,int>
vector<tiiii>adj[505][505][5];
signed main(){
    /*setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin >> n >> m >> a >> b >> c >> t;
    queue<pair<int,int>>q;
    for(int i=0;i<=n;i++){
        for(int j=0;j<=m;j++){
            dis[i][j]=INF;
        }
    }
    for(int i=0;i<t;i++){
        cin>>x[i]>>y[i];
        q.push({x[i],y[i]});
        dis[x[i]][y[i]]=0;
    }
    while(sz(q)){
        auto [x,y]=q.front();
        q.pop();
        for(int j=0;j<4;j++){
            int nx=x+dx[j],ny=y+dy[j];
            if(!valid(nx,ny))continue;
            if(dis[nx][ny]>dis[x][y]+1){
                dis[nx][ny]=dis[x][y]+1;
                q.push({nx,ny});
            }
        }
    }
    for(int i=0;i<=n;i++){
        for(int j=0;j<=m;j++){
            dist[i][j][0]=INF;
            for(int k=1;k<=4;k++){
                dist[i][j][k]=INF;
                int nx=i+dx[k-1],ny=j+dy[k-1];
                adj[i][j][0].pb({i,j,k,b});
                adj[i][j][k].pb({i,j,0,dis[i][j]*c});
                if(!valid(nx,ny))continue;
                adj[i][j][k].pb({nx,ny,k,a});
                adj[i][j][0].pb({nx,ny,0,c});
            }
        }
    }
    dist[x[0]][y[0]][0]=0;
    priority_queue<tiiii,vector<tiiii>,greater<tiiii>>pq;
    pq.push({0,x[0],y[0],0});
    while(sz(pq)){
        auto [d,x,y,k]=pq.top();
        //debug(d,x,y,k);
        pq.pop();
        if(d!=dist[x][y][k])
            continue;
        for(auto [nx,ny,nk,nc]:adj[x][y][k]){
            if(dist[nx][ny][nk]>d+nc){
                dist[nx][ny][nk]=d+nc;
                pq.push({d+nc,nx,ny,nk});
            }
        }
    }   
    cout<<dist[x[t-1]][y[t-1]][0]<<'\n';*/
}
 /*
 input:
 
 */

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 30300 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 30300 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 30300 KB Output isn't correct
2 Halted 0 ms 0 KB -