oj.uz

Submission #1034922

# Submission time Handle Problem Language Result Execution time Memory
1034922 2024-07-25T21:55:27 Z CSQ31 Board Game (JOI24_boardgame) C++17
3 / 100
 33 ms 4704 KB 
#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
const int MAXN = 5e4+50;
vector<int>adj[MAXN];
int main()
{
    int n,m,k;
    cin>>n>>m>>k;
    for(int i=0;i<m;i++){
        int u,v;
        cin>>u>>v;
        u--;
        v--;
        adj[u].pb(v);
        adj[v].pb(u);
    }

    int scnt = 0;
    string s;
    cin>>s;
    vector<int>T(k);
    for(int i=0;i<k;i++){cin>>T[i];T[i]--;}
    for(int i=0;i<n;i++)scnt += s[i]=='1';
    if(!scnt){
        queue<int>q;
        q.push(T[0]);
        vector<int>d(n,n);
        d[T[0]] = 0;
        while(!q.empty()){
            int v = q.front();
            q.pop();
            for(int x:adj[v]){
                if(d[x] > d[v]+1){
                    d[x] = d[v]+1;
                    q.push(x);
                }
            }
        }
        for(int i=0;i<n;i++)cout<<d[i]<<'\n';
    }
    
    vector<int>dist(n,1e9);

}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1624 KB Output is correct
2 Correct 20 ms 3420 KB Output is correct
3 Correct 33 ms 4704 KB Output is correct
4 Correct 25 ms 4248 KB Output is correct

Subtask #2
0.0 / 7.0

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

Subtask #3
0.0 / 7.0

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

Subtask #4
0.0 / 19.0

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

Subtask #5
0.0 / 23.0

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

Subtask #6
0.0 / 9.0

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

Subtask #7
0.0 / 23.0

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

Subtask #8
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1624 KB Output is correct
2 Correct 20 ms 3420 KB Output is correct
3 Correct 33 ms 4704 KB Output is correct
4 Correct 25 ms 4248 KB Output is correct
5 Incorrect 2 ms 1624 KB Output isn't correct
6 Halted 0 ms 0 KB -