oj.uz

Submission #710216

# Submission time Handle Problem Language Result Execution time Memory
710216 2023-03-15T05:48:09 Z penguin133 Stray Cat (JOI20_stray) C++17
9 / 100
 60 ms 16420 KB 
#include <bits/stdc++.h>
using namespace std;
#include "Anthony.h"
//#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
 
namespace {
 
int FunctionExample(int i, int A) {
  return i % A;
}
 
vector <int> adj[20005];
int dist[20005];
}  // namespace
 
std::vector<int> Mark(int N, int M, int A, int B,
                      std::vector<int> U, std::vector<int> V) {
  std::vector<int> X(M);
  for(int i=0;i<M;i++){
	  adj[U[i]].push_back(V[i]);
	  adj[V[i]].push_back(U[i]);
  }
  queue <int> qu;
  for(int i=0;i<N;i++)dist[i] = 1e9;
  dist[0] = 0;
  qu.push(0);
  while(!qu.empty()){
	  int x = qu.front(); qu.pop();
	  for(auto i : adj[x]){
		  if(dist[i] > dist[x] + 1)dist[i] = dist[x] + 1, qu.push(i);
	  }
  }
  for(int i=0;i<M;i++){
	  int x = max(dist[U[i]], dist[V[i]]);
	  X[i] = x % min(A, 3);
  }
  return X;
}

#include <bits/stdc++.h>
using namespace std;
#include "Catherine.h"
//#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
namespace {
 
int A, B;
int variable_example = 0;
 int prv= -1;
}  // namespace
 
void Init(int A, int B) {
  ::A = A;
  ::B = B;
}
 
int Move(std::vector<int> y) {
  ++variable_example;
  if(B != 0){
	for (int j = 0; j < A; ++j) {
    if (y[j] == 1 && j != prv) {
		prv = j;
      return j;
    }
  }
  return -1;
	}
  if(prv != -1){
	  prv--;
	  if(prv < 0)prv += 3;
	  return prv;
  }
  vector <int> stuf;
  int x = -1;
  for(int j=0;j<3;j++){
	  if(y[j] == 1)stuf.push_back(j);
	  else x = j;
  }
  if((int)stuf.size() == 1){prv = stuf[0]; return stuf[0];}
  else{
	  if(x == 0)prv = 1;
	  else if(x == 1)prv = 2;
	  else prv = 0;
	  return prv;
  }
}

Compilation message

Anthony.cpp:15:5: warning: 'int {anonymous}::FunctionExample(int, int)' defined but not used [-Wunused-function]
   15 | int FunctionExample(int i, int A) {
      |     ^~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 15256 KB Output is correct
2 Correct 2 ms 1020 KB Output is correct
3 Correct 31 ms 14716 KB Output is correct
4 Correct 52 ms 16420 KB Output is correct
5 Correct 56 ms 16400 KB Output is correct
6 Correct 46 ms 15136 KB Output is correct
7 Correct 43 ms 15460 KB Output is correct
8 Correct 44 ms 16236 KB Output is correct
9 Correct 57 ms 16244 KB Output is correct

Subtask #2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 15256 KB Output is correct
2 Correct 2 ms 1020 KB Output is correct
3 Correct 31 ms 14716 KB Output is correct
4 Correct 52 ms 16420 KB Output is correct
5 Correct 56 ms 16400 KB Output is correct
6 Correct 46 ms 15136 KB Output is correct
7 Correct 43 ms 15460 KB Output is correct
8 Correct 44 ms 16236 KB Output is correct
9 Correct 57 ms 16244 KB Output is correct
10 Incorrect 32 ms 13504 KB Wrong Answer [5]
11 Halted 0 ms 0 KB -

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 12768 KB Output is correct
2 Correct 2 ms 1028 KB Output is correct
3 Correct 44 ms 12500 KB Output is correct
4 Correct 60 ms 14324 KB Output is correct
5 Correct 56 ms 14136 KB Output is correct
6 Correct 49 ms 12916 KB Output is correct
7 Correct 47 ms 12944 KB Output is correct
8 Correct 47 ms 13472 KB Output is correct
9 Correct 53 ms 13512 KB Output is correct
10 Correct 49 ms 13236 KB Output is correct
11 Correct 41 ms 13292 KB Output is correct
12 Correct 48 ms 13332 KB Output is correct
13 Correct 47 ms 13208 KB Output is correct
14 Correct 59 ms 13532 KB Output is correct
15 Correct 46 ms 13596 KB Output is correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 12768 KB Output is correct
2 Correct 2 ms 1028 KB Output is correct
3 Correct 44 ms 12500 KB Output is correct
4 Correct 60 ms 14324 KB Output is correct
5 Correct 56 ms 14136 KB Output is correct
6 Correct 49 ms 12916 KB Output is correct
7 Correct 47 ms 12944 KB Output is correct
8 Correct 47 ms 13472 KB Output is correct
9 Correct 53 ms 13512 KB Output is correct
10 Correct 49 ms 13236 KB Output is correct
11 Correct 41 ms 13292 KB Output is correct
12 Correct 48 ms 13332 KB Output is correct
13 Correct 47 ms 13208 KB Output is correct
14 Correct 59 ms 13532 KB Output is correct
15 Correct 46 ms 13596 KB Output is correct
16 Incorrect 45 ms 11164 KB Wrong Answer [6]
17 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1372 KB Output is correct
2 Correct 1 ms 1028 KB Output is correct
3 Correct 2 ms 1284 KB Output is correct
4 Correct 3 ms 1336 KB Output is correct
5 Correct 2 ms 1284 KB Output is correct
6 Correct 2 ms 1288 KB Output is correct
7 Correct 3 ms 1292 KB Output is correct
8 Correct 2 ms 1296 KB Output is correct
9 Correct 2 ms 1292 KB Output is correct
10 Correct 2 ms 1296 KB Output is correct
11 Correct 2 ms 1292 KB Output is correct
12 Correct 2 ms 1284 KB Output is correct
13 Correct 2 ms 1292 KB Output is correct
14 Correct 3 ms 1292 KB Output is correct
15 Correct 2 ms 1284 KB Output is correct
16 Correct 2 ms 1284 KB Output is correct
17 Correct 2 ms 1284 KB Output is correct
18 Correct 2 ms 1284 KB Output is correct
19 Correct 2 ms 1284 KB Output is correct
20 Correct 2 ms 1292 KB Output is correct
21 Correct 2 ms 1292 KB Output is correct
22 Correct 2 ms 1284 KB Output is correct
23 Correct 2 ms 1284 KB Output is correct
24 Correct 2 ms 1284 KB Output is correct
25 Correct 2 ms 1292 KB Output is correct
26 Correct 2 ms 1280 KB Output is correct
27 Correct 2 ms 1292 KB Output is correct
28 Correct 2 ms 1288 KB Output is correct

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 11156 KB Output is correct
2 Correct 36 ms 11556 KB Output is correct
3 Correct 1 ms 1032 KB Output is correct
4 Correct 27 ms 10976 KB Output is correct
5 Correct 41 ms 12632 KB Output is correct
6 Correct 40 ms 12748 KB Output is correct
7 Incorrect 34 ms 11800 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 11228 KB Output is correct
2 Correct 38 ms 11416 KB Output is correct
3 Correct 1 ms 1032 KB Output is correct
4 Correct 26 ms 11060 KB Output is correct
5 Correct 40 ms 12596 KB Output is correct
6 Correct 48 ms 12636 KB Output is correct
7 Incorrect 38 ms 11704 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -