# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
947499 | phoenix0423 | Stray Cat (JOI20_stray) | C++17 | 44 ms | 16512 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pll;
#define pb push_back
#define eb emplace_back
const int INF = 1e9;
#include "Anthony.h"
vector<int> Mark(int n, int m, int a, int b, vector<int> u, vector<int> v){
vector<vector<pll>> adj(n);
vector<int> dist(n, INF), deg(n);
dist[0] = 0;
for(int i = 0; i < m; i++){
adj[u[i]].eb(v[i], i);
adj[v[i]].eb(u[i], i);
deg[u[i]] ++, deg[v[i]] ++;
}
vector<int> color(m, -1);
vector<int> bd(n);
bd[0] = 0;
queue<pll> q;
q.push({0, 0});
if(a >= 3){
while(!q.empty()){
auto [pos, lst] = q.front(); q.pop();
for(auto [x, id] : adj[pos]){
if(color[id] != -1) continue;
if(dist[x] != INF){
if(dist[x] >= dist[pos]) color[id] = (lst + 1) % a;
else color[id] = lst;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |