oj.uz

답안 #647944

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
647944 2022-10-04T16:48:28 Z beaconmc 길고양이 (JOI20_stray) C++14
0 / 100
 43 ms 16044 KB 
#include "Anthony.h"

#include <bits/stdc++.h>

typedef long long ll;
using namespace std;


#define FOR(i, x, y) for(ll i=x; i<y; i++)
#define FORNEG(i, x, y) for(ll i=x; i>y; i--)

#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)

namespace{}


vector<int> Mark(int N, int M, int A, int B, vector<int> U, vector<int> V) {

  vector<int> edges[N];
  FOR(i,0,M){
    edges[U[i]].push_back(V[i]);
    edges[V[i]].push_back(U[i]);
  }
  bool visited[N];
  FOR(i,0,N) visited[i] = false;


  vector<int> x(N);
  FOR(i,0,N) x[i] = 0;
  queue<vector<int>> q;

  q.push({0,0});
  while (q.size()){
    vector<int> node = q.front();
    q.pop();
    x[node[0]] = node[1];
    for (auto&i : edges[node[0]]){
      if (!visited[i]){
        visited[i] = true;
        q.push({i, node[1]+1});
      }
    }
  }
  vector<int> ans(M);
  FOR(i,0,M){
    ans[i] = (min(x[U[i]], x[V[i]])%3);
  }
  

  return ans;

}

#include "Catherine.h"
#include <bits/stdc++.h>

typedef long long ll;
using namespace std;


#define FOR(i, x, y) for(ll i=x; i<y; i++)
#define FORNEG(i, x, y) for(ll i=x; i>y; i--)

#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)

namespace {

int A, B;
int variable_example = 0;

}  // namespace

void Init(int A, int B) {
  ::A = A;
  ::B = B;
}

int Move(std::vector<int> y) {
  if (!y[0] && y[1] && y[2]){
    return 1;
  }
  if (y[0] && !y[1] && y[2]){
    return 2;
  }
  if (y[0] && y[1] && !y[2]){
    return 0;

  }
  if (y[0] && !y[1] && !y[2]){
    return 0;
  }
  if (!y[0] && y[1] && !y[2]){
    return 1;
  }
  if (!y[0] && !y[1] && y[2]){
    return 2;

  }
}

Compilation message

Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:46:1: warning: control reaches end of non-void function [-Wreturn-type]
   46 | }
      | ^
Catherine.cpp: At global scope:
Catherine.cpp:16:5: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
   16 | int variable_example = 0;
      |     ^~~~~~~~~~~~~~~~

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 15864 KB Output is correct
2 Correct 1 ms 516 KB Output is correct
3 Incorrect 33 ms 16044 KB Wrong Answer [6]
4 Halted 0 ms 0 KB -

Subtask #2
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 15864 KB Output is correct
2 Correct 1 ms 516 KB Output is correct
3 Incorrect 33 ms 16044 KB Wrong Answer [6]
4 Halted 0 ms 0 KB -

Subtask #3
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 13328 KB Output is correct
2 Correct 2 ms 520 KB Output is correct
3 Incorrect 32 ms 13332 KB Wrong Answer [6]
4 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 13328 KB Output is correct
2 Correct 2 ms 520 KB Output is correct
3 Incorrect 32 ms 13332 KB Wrong Answer [6]
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 648 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 2440 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 10 ms 2428 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -