Submission #1034920

#TimeUsernameProblemLanguageResultExecution timeMemory
1034920CSQ31Board Game (JOI24_boardgame)C++17
0 / 100
22 ms3668 KiB
#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); } string s; cin>>s; queue<int>q; for(int i=0;i<n;i++){ if(s[i] == '1')q.push(i); } if(q.empty()){ q.push(0); vector<int>d(n,n); d[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'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...