oj.uz

Submission #710260

# Submission time Handle Problem Language Result Execution time Memory
710260 2023-03-15T06:16:42 Z pcc Stray Cat (JOI20_stray) C++14
0 / 100
 40 ms 27152 KB 
#include "Anthony.h"
#include <vector>
#include <queue>
#include <cassert>

using namespace std;
std::vector<int> Mark(int N, int M, int A, int B,std::vector<int> U, std::vector<int> V) {
    vector<vector<pair<int,int>>> paths(N);
    for(int i = 0;i<M;i++){
      paths[U[i]].push_back({V[i],i});
      paths[V[i]].push_back({U[i],i});
    }
    vector<int> dist(N,-1);
    vector<int> col(M,-1);
    dist[0] = 0;
    queue<int> q;
    q.push(0);
    while(!q.empty()){
      auto now = q.front();
      q.pop();
      for(auto nxt:paths[now]){
        if(dist[nxt.first] != -1)continue;
        dist[nxt.first] = nxt.second+1;
        col[nxt.second] = dist[nxt.first]%3;
        q.push(nxt.first);
      }
    }
    for(int i = 0;i<M;i++)assert(col[i] != -1);
    return col;
}
#include "Catherine.h"
#include <set>
#include <vector>
#include <cassert>

void Init(int A, int B) {
  return;
}

using namespace std;
int Move(std::vector<int> y) {
  set<int> st;
  st.insert(1);
  st.insert(2);
  st.insert(0);
  for(int i = 0;i<3;i++)if(y[i])st.erase(i);
  assert(st.size()<3&&st.size()>0);
  if(st.size() == 2){
    for(int i = 0;i<3;i++)if(y[i])return i;
  }
  if(*st.begin() == 0)return 1;
  else if(*st.begin() == 1)return 2;
  else return 0;
  return -1;
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Runtime error 40 ms 27152 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Runtime error 40 ms 27152 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 2.0

# Verdict Execution time Memory Grader output
1 Runtime error 36 ms 22748 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 36 ms 22748 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

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

Subtask #6
0 / 71.0

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

Subtask #7
0 / 9.0

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