oj.uz

Submission #710237

# Submission time Handle Problem Language Result Execution time Memory
710237 2023-03-15T05:58:43 Z penguin133 Stray Cat (JOI20_stray) C++17
11 / 100
 60 ms 16472 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] = 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 40 ms 15332 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 38 ms 14744 KB Output is correct
4 Correct 54 ms 16348 KB Output is correct
5 Correct 49 ms 16472 KB Output is correct
6 Correct 41 ms 15152 KB Output is correct
7 Correct 49 ms 15124 KB Output is correct
8 Correct 49 ms 15716 KB Output is correct
9 Correct 45 ms 15808 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 15332 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 38 ms 14744 KB Output is correct
4 Correct 54 ms 16348 KB Output is correct
5 Correct 49 ms 16472 KB Output is correct
6 Correct 41 ms 15152 KB Output is correct
7 Correct 49 ms 15124 KB Output is correct
8 Correct 49 ms 15716 KB Output is correct
9 Correct 45 ms 15808 KB Output is correct
10 Correct 35 ms 13212 KB Output is correct
11 Correct 37 ms 13592 KB Output is correct
12 Correct 36 ms 13604 KB Output is correct
13 Correct 33 ms 13636 KB Output is correct
14 Correct 44 ms 14016 KB Output is correct
15 Correct 44 ms 14340 KB Output is correct
16 Correct 49 ms 16428 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 12904 KB Output is correct
2 Correct 1 ms 1032 KB Output is correct
3 Correct 31 ms 12420 KB Output is correct
4 Correct 49 ms 14224 KB Output is correct
5 Correct 51 ms 14192 KB Output is correct
6 Correct 36 ms 13020 KB Output is correct
7 Correct 36 ms 12924 KB Output is correct
8 Correct 41 ms 13548 KB Output is correct
9 Correct 44 ms 13488 KB Output is correct
10 Correct 38 ms 13244 KB Output is correct
11 Correct 48 ms 13212 KB Output is correct
12 Correct 60 ms 13236 KB Output is correct
13 Correct 37 ms 13220 KB Output is correct
14 Correct 38 ms 13656 KB Output is correct
15 Correct 40 ms 13680 KB Output is correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 12904 KB Output is correct
2 Correct 1 ms 1032 KB Output is correct
3 Correct 31 ms 12420 KB Output is correct
4 Correct 49 ms 14224 KB Output is correct
5 Correct 51 ms 14192 KB Output is correct
6 Correct 36 ms 13020 KB Output is correct
7 Correct 36 ms 12924 KB Output is correct
8 Correct 41 ms 13548 KB Output is correct
9 Correct 44 ms 13488 KB Output is correct
10 Correct 38 ms 13244 KB Output is correct
11 Correct 48 ms 13212 KB Output is correct
12 Correct 60 ms 13236 KB Output is correct
13 Correct 37 ms 13220 KB Output is correct
14 Correct 38 ms 13656 KB Output is correct
15 Correct 40 ms 13680 KB Output is correct
16 Incorrect 8 ms 2180 KB Wrong Answer [2]
17 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1284 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 2 ms 1292 KB Output is correct
4 Correct 2 ms 1364 KB Output is correct
5 Correct 2 ms 1288 KB Output is correct
6 Correct 2 ms 1284 KB Output is correct
7 Correct 2 ms 1284 KB Output is correct
8 Correct 2 ms 1292 KB Output is correct
9 Correct 2 ms 1284 KB Output is correct
10 Correct 2 ms 1284 KB Output is correct
11 Correct 2 ms 1296 KB Output is correct
12 Correct 2 ms 1292 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 1284 KB Output is correct
16 Correct 2 ms 1284 KB Output is correct
17 Correct 2 ms 1292 KB Output is correct
18 Correct 2 ms 1284 KB Output is correct
19 Correct 2 ms 1292 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 1296 KB Output is correct
23 Correct 2 ms 1284 KB Output is correct
24 Correct 2 ms 1256 KB Output is correct
25 Correct 2 ms 1292 KB Output is correct
26 Correct 2 ms 1292 KB Output is correct
27 Correct 2 ms 1292 KB Output is correct
28 Correct 2 ms 1292 KB Output is correct

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 11184 KB Output is correct
2 Correct 38 ms 11540 KB Output is correct
3 Correct 1 ms 1032 KB Output is correct
4 Correct 26 ms 11108 KB Output is correct
5 Correct 41 ms 12860 KB Output is correct
6 Correct 41 ms 12744 KB Output is correct
7 Incorrect 40 ms 11764 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 11192 KB Output is correct
2 Correct 37 ms 11560 KB Output is correct
3 Correct 1 ms 1020 KB Output is correct
4 Correct 27 ms 11040 KB Output is correct
5 Correct 48 ms 12680 KB Output is correct
6 Correct 51 ms 12556 KB Output is correct
7 Incorrect 33 ms 11772 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -