oj.uz

Submission #923255

# Submission time Handle Problem Language Result Execution time Memory
923255 2024-02-07T03:47:53 Z huutuan Stray Cat (JOI20_stray) C++14
91 / 100
 46 ms 17248 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);
   }
   cerr << "check " << lmao << endl;
   if ((sussy+sussy).find(lmao)!=string::npos){
      cerr << "sus " << lmao << endl;
      return 1;
   }
   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[1]==1){
      v.emplace_back(y[0]<=1, 1);
      return 1;
   }
   if (y[0]==1){
      v.emplace_back(y[1]<=1, 0);
      return 0;
   }
   if (y[1]){
      v.emplace_back(0, 1);
      return 1;
   }
   if (y[0]){
      v.emplace_back(0, 0);
      return 0;
   }
   return -1;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 16188 KB Output is correct
2 Correct 1 ms 1808 KB Output is correct
3 Correct 23 ms 15724 KB Output is correct
4 Correct 40 ms 17204 KB Output is correct
5 Correct 34 ms 17248 KB Output is correct
6 Correct 26 ms 15992 KB Output is correct
7 Correct 26 ms 16012 KB Output is correct
8 Correct 32 ms 16908 KB Output is correct
9 Correct 32 ms 16764 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 16188 KB Output is correct
2 Correct 1 ms 1808 KB Output is correct
3 Correct 23 ms 15724 KB Output is correct
4 Correct 40 ms 17204 KB Output is correct
5 Correct 34 ms 17248 KB Output is correct
6 Correct 26 ms 15992 KB Output is correct
7 Correct 26 ms 16012 KB Output is correct
8 Correct 32 ms 16908 KB Output is correct
9 Correct 32 ms 16764 KB Output is correct
10 Correct 25 ms 14192 KB Output is correct
11 Correct 29 ms 14132 KB Output is correct
12 Correct 26 ms 14108 KB Output is correct
13 Correct 26 ms 14168 KB Output is correct
14 Correct 26 ms 14460 KB Output is correct
15 Correct 27 ms 14712 KB Output is correct
16 Correct 31 ms 16752 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 13696 KB Output is correct
2 Correct 1 ms 1808 KB Output is correct
3 Correct 26 ms 13436 KB Output is correct
4 Correct 33 ms 15220 KB Output is correct
5 Correct 46 ms 15144 KB Output is correct
6 Correct 36 ms 13628 KB Output is correct
7 Correct 27 ms 13648 KB Output is correct
8 Correct 31 ms 14368 KB Output is correct
9 Correct 30 ms 14280 KB Output is correct
10 Correct 28 ms 14164 KB Output is correct
11 Correct 32 ms 14076 KB Output is correct
12 Correct 27 ms 14172 KB Output is correct
13 Correct 28 ms 14188 KB Output is correct
14 Correct 31 ms 14380 KB Output is correct
15 Correct 30 ms 14372 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 13696 KB Output is correct
2 Correct 1 ms 1808 KB Output is correct
3 Correct 26 ms 13436 KB Output is correct
4 Correct 33 ms 15220 KB Output is correct
5 Correct 46 ms 15144 KB Output is correct
6 Correct 36 ms 13628 KB Output is correct
7 Correct 27 ms 13648 KB Output is correct
8 Correct 31 ms 14368 KB Output is correct
9 Correct 30 ms 14280 KB Output is correct
10 Correct 28 ms 14164 KB Output is correct
11 Correct 32 ms 14076 KB Output is correct
12 Correct 27 ms 14172 KB Output is correct
13 Correct 28 ms 14188 KB Output is correct
14 Correct 31 ms 14380 KB Output is correct
15 Correct 30 ms 14372 KB Output is correct
16 Correct 25 ms 12156 KB Output is correct
17 Correct 24 ms 12152 KB Output is correct
18 Correct 25 ms 12152 KB Output is correct
19 Correct 24 ms 12156 KB Output is correct
20 Correct 27 ms 12920 KB Output is correct
21 Correct 26 ms 12652 KB Output is correct
22 Correct 31 ms 14648 KB Output is correct
23 Correct 26 ms 12724 KB Output is correct
24 Correct 26 ms 12232 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2072 KB Output is correct
2 Correct 1 ms 1804 KB Output is correct
3 Correct 3 ms 2060 KB Output is correct
4 Correct 2 ms 2072 KB Output is correct
5 Correct 2 ms 2072 KB Output is correct
6 Correct 2 ms 2068 KB Output is correct
7 Correct 2 ms 2072 KB Output is correct
8 Correct 2 ms 2072 KB Output is correct
9 Correct 2 ms 2076 KB Output is correct
10 Correct 2 ms 2080 KB Output is correct
11 Correct 1 ms 2080 KB Output is correct
12 Correct 2 ms 2072 KB Output is correct
13 Correct 2 ms 2072 KB Output is correct
14 Correct 2 ms 2064 KB Output is correct
15 Correct 1 ms 2080 KB Output is correct
16 Correct 2 ms 2080 KB Output is correct
17 Correct 2 ms 2268 KB Output is correct
18 Correct 2 ms 2072 KB Output is correct
19 Correct 2 ms 2080 KB Output is correct
20 Correct 2 ms 2072 KB Output is correct
21 Correct 3 ms 2076 KB Output is correct
22 Correct 2 ms 2068 KB Output is correct
23 Correct 1 ms 2072 KB Output is correct
24 Correct 2 ms 2064 KB Output is correct
25 Correct 2 ms 2072 KB Output is correct
26 Correct 2 ms 2084 KB Output is correct
27 Correct 2 ms 2076 KB Output is correct
28 Correct 1 ms 2080 KB Output is correct

Subtask #6
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 12240 KB Output is correct
2 Correct 31 ms 12848 KB Output is correct
3 Correct 1 ms 1812 KB Output is correct
4 Correct 20 ms 11900 KB Output is correct
5 Correct 44 ms 13444 KB Output is correct
6 Correct 33 ms 13644 KB Output is correct
7 Correct 30 ms 12368 KB Output is correct
8 Correct 25 ms 12616 KB Output is correct
9 Correct 32 ms 13492 KB Output is correct
10 Correct 31 ms 13572 KB Output is correct
11 Correct 31 ms 13448 KB Output is correct
12 Correct 31 ms 13580 KB Output is correct
13 Correct 36 ms 13432 KB Output is correct
14 Correct 43 ms 13392 KB Output is correct
15 Correct 36 ms 13676 KB Output is correct
16 Correct 31 ms 13420 KB Output is correct
17 Correct 34 ms 13044 KB Output is correct
18 Correct 28 ms 13184 KB Output is correct
19 Correct 30 ms 13184 KB Output is correct
20 Correct 32 ms 13184 KB Output is correct
21 Correct 28 ms 13128 KB Output is correct
22 Correct 30 ms 13200 KB Output is correct
23 Correct 24 ms 12100 KB Output is correct
24 Correct 24 ms 12156 KB Output is correct
25 Correct 31 ms 12288 KB Output is correct
26 Correct 26 ms 12400 KB Output is correct
27 Correct 28 ms 13068 KB Output is correct
28 Correct 26 ms 13176 KB Output is correct
29 Correct 35 ms 13116 KB Output is correct
30 Correct 30 ms 13096 KB Output is correct
31 Correct 30 ms 12420 KB Output is correct
32 Correct 28 ms 12112 KB Output is correct
33 Correct 25 ms 12420 KB Output is correct
34 Correct 27 ms 12392 KB Output is correct
35 Correct 34 ms 12860 KB Output is correct
36 Correct 28 ms 13048 KB Output is correct
37 Correct 27 ms 12916 KB Output is correct
38 Correct 31 ms 13028 KB Output is correct
39 Correct 27 ms 13128 KB Output is correct
40 Correct 28 ms 13140 KB Output is correct
41 Correct 36 ms 13172 KB Output is correct
42 Correct 30 ms 13152 KB Output is correct
43 Correct 30 ms 13092 KB Output is correct
44 Correct 32 ms 13176 KB Output is correct
45 Correct 31 ms 13160 KB Output is correct
46 Correct 28 ms 13172 KB Output is correct
47 Correct 27 ms 12668 KB Output is correct
48 Correct 33 ms 12660 KB Output is correct
49 Correct 30 ms 12400 KB Output is correct
50 Correct 33 ms 12728 KB Output is correct
51 Correct 30 ms 12388 KB Output is correct
52 Correct 29 ms 12152 KB Output is correct
53 Correct 24 ms 12344 KB Output is correct
54 Correct 25 ms 12156 KB Output is correct
55 Correct 25 ms 12148 KB Output is correct
56 Correct 26 ms 12136 KB Output is correct
57 Correct 27 ms 12348 KB Output is correct
58 Correct 30 ms 12668 KB Output is correct
59 Correct 28 ms 12148 KB Output is correct
60 Correct 24 ms 12156 KB Output is correct

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 12144 KB Output is correct
2 Correct 27 ms 12912 KB Output is correct
3 Correct 1 ms 1808 KB Output is correct
4 Correct 20 ms 11880 KB Output is correct
5 Correct 32 ms 13508 KB Output is correct
6 Correct 33 ms 13760 KB Output is correct
7 Incorrect 27 ms 12464 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -