oj.uz

Submission #923240

# Submission time Handle Problem Language Result Execution time Memory
923240 2024-02-07T02:56:29 Z huutuan Stray Cat (JOI20_stray) C++14
15 / 100
 44 ms 18604 KB 
#include "Anthony.h"
#include <bits/stdc++.h>

using namespace std;

#ifndef sus
#define cerr if (0) cerr
#endif

const int N=2e4+10;

namespace sub1234{
   vector<int> g[N];
   vector<int> ans;
   int dep[N];
   void bfs(){
      memset(dep, -1, sizeof dep);
      queue<int> q;
      q.push(0); dep[0]=0;
      while (q.size()){
         int u=q.front(); q.pop();
         for (int v:g[u]){
            if (dep[v]==-1){
               dep[v]=dep[u]+1;
               q.push(v);
            }
         }
      }
   }
   vector<int> solve(int n, int m, vector<int> u, vector<int> v){
      ans.resize(m, -1);
      for (int i=0; i<m; ++i){
         g[u[i]].push_back(v[i]);
         g[v[i]].push_back(u[i]);
      }
      bfs();
      for (int i=0; i<m; ++i){
         ans[i]=min(dep[u[i]], dep[v[i]])%3;
         cerr << u[i] << ' ' << v[i] << ' ' << ans[i] << '\n';
      }
      return ans;
   }
}

namespace sub567{
   string sussy="011001";
   vector<int> path;
   vector<pair<int, int>> g[N];
   vector<int> ans;
   int par_idx[N];
   void dfs(int u, int p){
      pair<int, int> pp={-1, -1};
      for (auto &e:g[u]) if (e.first==p) pp=e;
      if (pp.first!=-1) g[u].erase(find(g[u].begin(), g[u].end(), pp));
      if ((int)g[u].size()==1){
         if (path.empty()) path.push_back(par_idx[u]);
         path.push_back(g[u][0].second);
         par_idx[g[u][0].first]=g[u][0].second;
         dfs(g[u][0].first, u);
      }else{
         if (path.size()){
            int first_edge=path[0]==-1?0:ans[path[0]]^1;
            path.erase(path.begin());
            for (int i=0; i<(int)path.size(); ++i) ans[path[i]]=sussy[(i+first_edge)%6]-'0';
         }
         path.clear();
         for (auto &e:g[u]){
            int v=e.first, i=e.second;
            ans[i]=par_idx[u]==-1?0:ans[par_idx[u]]^1;
            par_idx[v]=i;
            if ((int)g[v].size()==1){
               path.clear();
               path.push_back(par_idx[u]);
            }
            dfs(v, u);
         }
      }
   }
   vector<int> solve(int n, int m, vector<int> u, vector<int> v){
      ans.resize(m);
      par_idx[0]=-1;
      for (int i=0; i<m; ++i){
         g[u[i]].emplace_back(v[i], i);
         g[v[i]].emplace_back(u[i], i);
      }
      dfs(0, -1);
      for (int i=0; i<m; ++i) cerr << u[i] << ' ' << v[i] << ' ' << ans[i] << '\n';
      return ans;
   }
}

vector<int> Mark(int n, int m, int a, int b,
                 vector<int> u, vector<int> v) {
   if (a!=2){
      return sub1234::solve(n, m, u, v);
   }
   return sub567::solve(n, m, u, v);
}

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

using namespace std;

#ifndef sus
#define cerr if (0) cerr
#endif

int a, b;

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

vector<pair<int, int>> v;

string sussy="011001";

bool check_sus(){
   if ((int)v.size()<5) return 0;
   string lmao;
   for (int i=5; i>=1; --i){
      if (v.end()[-i].first!=1) return 0;
      lmao.push_back('0'+v.end()[-i].second);
   }
   for (int i=0; i<5; ++i){
      if ((sussy+sussy).find(lmao)!=string::npos) return 1;
      lmao.push_back(lmao[0]); lmao.erase(lmao.begin());
   }
   return 0;
}

int Move(vector<int> y) {
   if (a!=2){
      if (y[0] && y[1]) return 0;
      if (y[1] && y[2]) return 1;
      if (y[2] && y[0]) return 2;
      for (int i=0; i<3; ++i) if (y[i]) return i;
   }
   if (y[0]+y[1]==1){
      if (y[0]){
         v.emplace_back(1, 0);
         if (check_sus()){
            v.emplace_back(-1, v.back().second);
            return -1;
         }
         return 0;
      }else{
         v.emplace_back(1, 1);
         if (check_sus()){
            v.emplace_back(-1, v.back().second);
            return -1;
         }
         return 1;
      }
   }
   if (v.size()){
      int lst=v.back().second;
      if (y[lst^1]==1){
         v.emplace_back(0, lst^1);
         return lst^1;
      }
      v.emplace_back(-1, lst);
      return -1;
   }
   if (y[0]==1){
      v.emplace_back(0, 0);
      return 0;
   }
   if (y[1]==1){
      v.emplace_back(0, 1);
      return 1;
   }
   if (y[0]){
      v.emplace_back(0, 0);
      return 0;
   }
   if (y[1]){
      v.emplace_back(0, 1);
      return 1;
   }
   return -1;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 16680 KB Output is correct
2 Correct 1 ms 1816 KB Output is correct
3 Correct 25 ms 15916 KB Output is correct
4 Correct 40 ms 18604 KB Output is correct
5 Correct 34 ms 17744 KB Output is correct
6 Correct 28 ms 16420 KB Output is correct
7 Correct 27 ms 16464 KB Output is correct
8 Correct 44 ms 17136 KB Output is correct
9 Correct 34 ms 17340 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 16680 KB Output is correct
2 Correct 1 ms 1816 KB Output is correct
3 Correct 25 ms 15916 KB Output is correct
4 Correct 40 ms 18604 KB Output is correct
5 Correct 34 ms 17744 KB Output is correct
6 Correct 28 ms 16420 KB Output is correct
7 Correct 27 ms 16464 KB Output is correct
8 Correct 44 ms 17136 KB Output is correct
9 Correct 34 ms 17340 KB Output is correct
10 Correct 26 ms 14672 KB Output is correct
11 Correct 26 ms 14712 KB Output is correct
12 Correct 28 ms 14652 KB Output is correct
13 Correct 32 ms 14348 KB Output is correct
14 Correct 26 ms 14920 KB Output is correct
15 Correct 28 ms 15180 KB Output is correct
16 Correct 31 ms 17212 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 14152 KB Output is correct
2 Correct 1 ms 1812 KB Output is correct
3 Correct 23 ms 13612 KB Output is correct
4 Correct 32 ms 15700 KB Output is correct
5 Correct 33 ms 15472 KB Output is correct
6 Correct 26 ms 14152 KB Output is correct
7 Correct 26 ms 14168 KB Output is correct
8 Correct 32 ms 14896 KB Output is correct
9 Correct 36 ms 14928 KB Output is correct
10 Correct 28 ms 14636 KB Output is correct
11 Correct 27 ms 14676 KB Output is correct
12 Correct 27 ms 14596 KB Output is correct
13 Correct 28 ms 14612 KB Output is correct
14 Correct 30 ms 14868 KB Output is correct
15 Correct 30 ms 15132 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 14152 KB Output is correct
2 Correct 1 ms 1812 KB Output is correct
3 Correct 23 ms 13612 KB Output is correct
4 Correct 32 ms 15700 KB Output is correct
5 Correct 33 ms 15472 KB Output is correct
6 Correct 26 ms 14152 KB Output is correct
7 Correct 26 ms 14168 KB Output is correct
8 Correct 32 ms 14896 KB Output is correct
9 Correct 36 ms 14928 KB Output is correct
10 Correct 28 ms 14636 KB Output is correct
11 Correct 27 ms 14676 KB Output is correct
12 Correct 27 ms 14596 KB Output is correct
13 Correct 28 ms 14612 KB Output is correct
14 Correct 30 ms 14868 KB Output is correct
15 Correct 30 ms 15132 KB Output is correct
16 Correct 23 ms 12608 KB Output is correct
17 Correct 23 ms 12608 KB Output is correct
18 Correct 24 ms 12596 KB Output is correct
19 Correct 26 ms 12608 KB Output is correct
20 Correct 31 ms 13444 KB Output is correct
21 Correct 26 ms 13128 KB Output is correct
22 Correct 28 ms 15440 KB Output is correct
23 Correct 25 ms 12884 KB Output is correct
24 Correct 25 ms 12876 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2084 KB Output is correct
2 Correct 1 ms 1808 KB Output is correct
3 Correct 1 ms 2084 KB Output is correct
4 Incorrect 2 ms 2076 KB Wrong Answer [6]
5 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 13016 KB Output is correct
2 Incorrect 25 ms 13128 KB Wrong Answer [6]
3 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 12612 KB Output is correct
2 Incorrect 26 ms 13252 KB Wrong Answer [6]
3 Halted 0 ms 0 KB -