oj.uz

Submission #829836

# Submission time Handle Problem Language Result Execution time Memory
829836 2023-08-18T15:18:57 Z birthdaycake Stray Cat (JOI20_stray) C++14
4 / 100
 40 ms 20808 KB 
#include "Anthony.h"
#include<bits/stdc++.h>
using namespace std; 

vector<int>adj[200001];
int depth[200001],col[200001];


vector<int> Mark(int N, int M, int A, int B, vector<int> U, vector<int> V) {
  for(int i = 0; i < N; i++) {
    adj[i].clear();
    depth[i] = 1e9; 
  }
  for(int i = 0; i < M; i++){
    adj[U[i]].push_back(V[i]);
    adj[V[i]].push_back(U[i]);
  }
  priority_queue<pair<int,int>>d; 
  d.push({0,0});
  depth[0] = 0; 
  while(d.size()){
    auto x = d.top(); 
    d.pop();
    x.first *= -1;
    if(depth[x.second] < x.first) continue; 
    for(auto s: adj[x.second]){
      if(x.first + 1 < depth[s]){
        depth[s] = x.first + 1;
        d.push({-depth[s], s});
      }
    }
  }
  vector<int>ans; 
  for(int i = 0; i < M; i++){
    ans.push_back(max(depth[U[i]], depth[V[i]]) % 3); 
  }
  return ans; 
}

#include "Catherine.h"
#include<bits/stdc++.h>
using namespace std; 
int a,b;
void Init(int A, int B) {
  a = A;
  b = B;
}

int Move(vector<int> y) {
  set<int>p;
  int col = 0;
  for(auto s: y) {
    if(s > 0) p.insert(col);
    col++;
  }
  auto xx = *p.begin(); 
  p.erase(p.begin()); 
  if(p.empty()) return xx; 
  if(xx == 0 and *p.begin() == 1) return 0; 
  if(xx == 1 and *p.begin() == 2) return 1; 
  if(xx == 0 and *p.begin() == 2) return 2; 
  return -1;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 19700 KB Output is correct
2 Correct 2 ms 5256 KB Output is correct
3 Correct 29 ms 19052 KB Output is correct
4 Correct 40 ms 20772 KB Output is correct
5 Correct 38 ms 20808 KB Output is correct
6 Correct 32 ms 19552 KB Output is correct
7 Correct 32 ms 19580 KB Output is correct
8 Correct 34 ms 20204 KB Output is correct
9 Correct 34 ms 20228 KB Output is correct

Subtask #2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 19700 KB Output is correct
2 Correct 2 ms 5256 KB Output is correct
3 Correct 29 ms 19052 KB Output is correct
4 Correct 40 ms 20772 KB Output is correct
5 Correct 38 ms 20808 KB Output is correct
6 Correct 32 ms 19552 KB Output is correct
7 Correct 32 ms 19580 KB Output is correct
8 Correct 34 ms 20204 KB Output is correct
9 Correct 34 ms 20228 KB Output is correct
10 Incorrect 27 ms 17504 KB Wrong Answer [6]
11 Halted 0 ms 0 KB -

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 17304 KB Output is correct
2 Correct 3 ms 5264 KB Output is correct
3 Correct 26 ms 16828 KB Output is correct
4 Correct 40 ms 18792 KB Output is correct
5 Correct 37 ms 18600 KB Output is correct
6 Correct 30 ms 17348 KB Output is correct
7 Correct 28 ms 17420 KB Output is correct
8 Correct 31 ms 17912 KB Output is correct
9 Correct 32 ms 17952 KB Output is correct
10 Correct 36 ms 17648 KB Output is correct
11 Correct 28 ms 17640 KB Output is correct
12 Correct 30 ms 17800 KB Output is correct
13 Correct 31 ms 17628 KB Output is correct
14 Correct 33 ms 17908 KB Output is correct
15 Correct 32 ms 18008 KB Output is correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 17304 KB Output is correct
2 Correct 3 ms 5264 KB Output is correct
3 Correct 26 ms 16828 KB Output is correct
4 Correct 40 ms 18792 KB Output is correct
5 Correct 37 ms 18600 KB Output is correct
6 Correct 30 ms 17348 KB Output is correct
7 Correct 28 ms 17420 KB Output is correct
8 Correct 31 ms 17912 KB Output is correct
9 Correct 32 ms 17952 KB Output is correct
10 Correct 36 ms 17648 KB Output is correct
11 Correct 28 ms 17640 KB Output is correct
12 Correct 30 ms 17800 KB Output is correct
13 Correct 31 ms 17628 KB Output is correct
14 Correct 33 ms 17908 KB Output is correct
15 Correct 32 ms 18008 KB Output is correct
16 Incorrect 25 ms 15548 KB Wrong Answer [6]
17 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 5260 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 6552 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 6560 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -