oj.uz

Submission #911195

# Submission time Handle Problem Language Result Execution time Memory
911195 2024-01-18T15:24:23 Z winter0101 Stray Cat (JOI20_stray) C++14
15 / 100
 48 ms 16552 KB 
#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
const int maxn=2e4+9;
vector<int>a[maxn];
bool vis[maxn];
int d[maxn];
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);
  int n=N,m=M;
  for1(i,0,m-1){
  a[U[i]].pb(V[i]);
  a[V[i]].pb(U[i]);
  }
  vis[0]=1;
  queue<int>t;
  t.push(0);
  while (!t.empty()){
  auto u=t.front();
  t.pop();
  for (auto v:a[u]){
  if (vis[v])continue;
  d[v]=d[u]+1;
  t.push(v);
  vis[v]=1;
  }
  }
  for (int i = 0; i < M; ++i) {
  int u=U[i],v=V[i];
  if (d[u]==d[v]){
  int t1=(d[u]%3),t2=(t1+1)%3;
  if (t1==1||t2==1)x[i]|=(1<<0);
  if (t1==2||t2==2)x[i]|=(1<<1);
  x[i]--;
  continue;
  }
  if (d[u]>d[v])swap(u,v);
  int mask=0;
  if (d[u]%3==2||d[v]%3==2)mask|=(1<<1);
  if (d[u]%3==1||d[v]%3==1)mask|=(1<<0);
  x[i]=mask-1;
  }
  return x;
}
#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
namespace {
 
int A, B;
int variable_example = 0;
 
}  // namespace
 
void Init(int A, int B) {
  ::A = A;
  ::B = B;
}
int cnt[3];
int Move(std::vector<int> y) {
  int ct=0;
  for1(i,0,2){
  if (y[i]!=0)ct++;
  }
  if (ct==1){
  for1(i,0,2){
  if (y[i]!=0)return i;
  }
  }
  for1(i,0,2)cnt[i]=0;
  for1(i,0,2){
  if (y[i]!=0){
  int j=i+1;
  for1(k,0,1){
  if (j>>k&1){
  cnt[(1<<k)]++;
  }
  else {
  cnt[0]++;
  }
  }
  }
  }
  for1(i,0,2){
  if (cnt[i]==2){
  int ans=i;
  int gg=(i-1+3)%3;
  ans+=gg;
  return ans-1;
  }
  }
}

Compilation message

Anthony.cpp: In function 'std::vector<int> Mark(int, int, int, int, std::vector<int>, std::vector<int>)':
Anthony.cpp:23:7: warning: unused variable 'n' [-Wunused-variable]
   23 |   int n=N,m=M;
      |       ^

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

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 15512 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 25 ms 14960 KB Output is correct
4 Correct 38 ms 16436 KB Output is correct
5 Correct 48 ms 16552 KB Output is correct
6 Correct 31 ms 15596 KB Output is correct
7 Correct 28 ms 15464 KB Output is correct
8 Correct 34 ms 16004 KB Output is correct
9 Correct 34 ms 15844 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 15512 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 25 ms 14960 KB Output is correct
4 Correct 38 ms 16436 KB Output is correct
5 Correct 48 ms 16552 KB Output is correct
6 Correct 31 ms 15596 KB Output is correct
7 Correct 28 ms 15464 KB Output is correct
8 Correct 34 ms 16004 KB Output is correct
9 Correct 34 ms 15844 KB Output is correct
10 Correct 26 ms 13356 KB Output is correct
11 Correct 34 ms 13264 KB Output is correct
12 Correct 30 ms 13420 KB Output is correct
13 Correct 28 ms 13360 KB Output is correct
14 Correct 30 ms 13680 KB Output is correct
15 Correct 34 ms 13940 KB Output is correct
16 Correct 35 ms 15908 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 13184 KB Output is correct
2 Correct 1 ms 1292 KB Output is correct
3 Correct 28 ms 12648 KB Output is correct
4 Correct 34 ms 14312 KB Output is correct
5 Correct 33 ms 14124 KB Output is correct
6 Correct 32 ms 13176 KB Output is correct
7 Correct 31 ms 13128 KB Output is correct
8 Correct 31 ms 13696 KB Output is correct
9 Correct 31 ms 13660 KB Output is correct
10 Correct 28 ms 13688 KB Output is correct
11 Correct 31 ms 13612 KB Output is correct
12 Correct 37 ms 13352 KB Output is correct
13 Correct 38 ms 13360 KB Output is correct
14 Correct 33 ms 13680 KB Output is correct
15 Correct 34 ms 13696 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 13184 KB Output is correct
2 Correct 1 ms 1292 KB Output is correct
3 Correct 28 ms 12648 KB Output is correct
4 Correct 34 ms 14312 KB Output is correct
5 Correct 33 ms 14124 KB Output is correct
6 Correct 32 ms 13176 KB Output is correct
7 Correct 31 ms 13128 KB Output is correct
8 Correct 31 ms 13696 KB Output is correct
9 Correct 31 ms 13660 KB Output is correct
10 Correct 28 ms 13688 KB Output is correct
11 Correct 31 ms 13612 KB Output is correct
12 Correct 37 ms 13352 KB Output is correct
13 Correct 38 ms 13360 KB Output is correct
14 Correct 33 ms 13680 KB Output is correct
15 Correct 34 ms 13696 KB Output is correct
16 Correct 25 ms 11376 KB Output is correct
17 Correct 26 ms 11852 KB Output is correct
18 Correct 32 ms 11796 KB Output is correct
19 Correct 30 ms 11904 KB Output is correct
20 Correct 30 ms 12568 KB Output is correct
21 Correct 26 ms 12352 KB Output is correct
22 Correct 31 ms 14352 KB Output is correct
23 Correct 27 ms 12012 KB Output is correct
24 Correct 27 ms 12168 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1308 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 2324 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

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