oj.uz

Submission #710314

# Submission time Handle Problem Language Result Execution time Memory
710314 2023-03-15T07:11:44 Z penguin133 Stray Cat (JOI20_stray) C++17
20 / 100
 60 ms 16352 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];
  int used[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]]);
    if(abs(dist[U[i]] - dist[V[i]]) != 1)X[i] = (x + 1) % 3;
	 else 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:21:7: warning: '{anonymous}::used' defined but not used [-Wunused-variable]
   21 |   int used[20005];
      |       ^~~~
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 41 ms 15264 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 37 ms 14688 KB Output is correct
4 Correct 47 ms 16328 KB Output is correct
5 Correct 50 ms 16352 KB Output is correct
6 Correct 38 ms 15084 KB Output is correct
7 Correct 36 ms 14996 KB Output is correct
8 Correct 46 ms 15756 KB Output is correct
9 Correct 43 ms 15816 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 15264 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 37 ms 14688 KB Output is correct
4 Correct 47 ms 16328 KB Output is correct
5 Correct 50 ms 16352 KB Output is correct
6 Correct 38 ms 15084 KB Output is correct
7 Correct 36 ms 14996 KB Output is correct
8 Correct 46 ms 15756 KB Output is correct
9 Correct 43 ms 15816 KB Output is correct
10 Correct 44 ms 13132 KB Output is correct
11 Correct 34 ms 13252 KB Output is correct
12 Correct 33 ms 13296 KB Output is correct
13 Correct 37 ms 13228 KB Output is correct
14 Correct 35 ms 13540 KB Output is correct
15 Correct 42 ms 13860 KB Output is correct
16 Correct 40 ms 15920 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 12836 KB Output is correct
2 Correct 1 ms 1020 KB Output is correct
3 Correct 33 ms 12436 KB Output is correct
4 Correct 44 ms 14324 KB Output is correct
5 Correct 50 ms 14264 KB Output is correct
6 Correct 33 ms 13008 KB Output is correct
7 Correct 32 ms 13044 KB Output is correct
8 Correct 39 ms 13608 KB Output is correct
9 Correct 38 ms 13504 KB Output is correct
10 Correct 39 ms 13236 KB Output is correct
11 Correct 39 ms 13292 KB Output is correct
12 Correct 37 ms 13380 KB Output is correct
13 Correct 48 ms 13340 KB Output is correct
14 Correct 40 ms 13636 KB Output is correct
15 Correct 39 ms 13548 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 12836 KB Output is correct
2 Correct 1 ms 1020 KB Output is correct
3 Correct 33 ms 12436 KB Output is correct
4 Correct 44 ms 14324 KB Output is correct
5 Correct 50 ms 14264 KB Output is correct
6 Correct 33 ms 13008 KB Output is correct
7 Correct 32 ms 13044 KB Output is correct
8 Correct 39 ms 13608 KB Output is correct
9 Correct 38 ms 13504 KB Output is correct
10 Correct 39 ms 13236 KB Output is correct
11 Correct 39 ms 13292 KB Output is correct
12 Correct 37 ms 13380 KB Output is correct
13 Correct 48 ms 13340 KB Output is correct
14 Correct 40 ms 13636 KB Output is correct
15 Correct 39 ms 13548 KB Output is correct
16 Correct 31 ms 11368 KB Output is correct
17 Correct 34 ms 11320 KB Output is correct
18 Correct 39 ms 11276 KB Output is correct
19 Correct 30 ms 11372 KB Output is correct
20 Correct 38 ms 11920 KB Output is correct
21 Correct 34 ms 11632 KB Output is correct
22 Correct 42 ms 13816 KB Output is correct
23 Correct 31 ms 11500 KB Output is correct
24 Correct 32 ms 11436 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1292 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 2 ms 1284 KB Output is correct
4 Correct 2 ms 1284 KB Output is correct
5 Correct 2 ms 1292 KB Output is correct
6 Correct 2 ms 1284 KB Output is correct
7 Correct 3 ms 1292 KB Output is correct
8 Correct 2 ms 1284 KB Output is correct
9 Correct 2 ms 1296 KB Output is correct
10 Correct 2 ms 1284 KB Output is correct
11 Correct 2 ms 1284 KB Output is correct
12 Correct 2 ms 1284 KB Output is correct
13 Correct 2 ms 1292 KB Output is correct
14 Correct 2 ms 1284 KB Output is correct
15 Correct 2 ms 1292 KB Output is correct
16 Correct 2 ms 1292 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 1288 KB Output is correct
20 Correct 2 ms 1284 KB Output is correct
21 Correct 3 ms 1284 KB Output is correct
22 Correct 2 ms 1292 KB Output is correct
23 Correct 2 ms 1284 KB Output is correct
24 Correct 3 ms 1292 KB Output is correct
25 Correct 3 ms 1292 KB Output is correct
26 Correct 2 ms 1292 KB Output is correct
27 Correct 2 ms 1284 KB Output is correct
28 Correct 2 ms 1284 KB Output is correct

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 11124 KB Output is correct
2 Correct 60 ms 11480 KB Output is correct
3 Correct 1 ms 1016 KB Output is correct
4 Correct 28 ms 10992 KB Output is correct
5 Correct 54 ms 12740 KB Output is correct
6 Correct 54 ms 12628 KB Output is correct
7 Incorrect 33 ms 11932 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 11176 KB Output is correct
2 Correct 41 ms 11524 KB Output is correct
3 Correct 1 ms 1028 KB Output is correct
4 Correct 28 ms 10952 KB Output is correct
5 Correct 47 ms 12636 KB Output is correct
6 Correct 52 ms 12616 KB Output is correct
7 Incorrect 28 ms 11744 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -