oj.uz

Submission #947483

# Submission time Handle Problem Language Result Execution time Memory
947483 2024-03-16T09:27:20 Z phoenix0423 Stray Cat (JOI20_stray) C++17
15 / 100
 37 ms 16572 KB 
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pll;
#define pb push_back
#define eb emplace_back
const int INF = 1e9;
#include "Anthony.h"

vector<int> Mark(int n, int m, int a, int b, vector<int> u, vector<int> v){
    vector<vector<pll>> adj(n);
    vector<int> dist(n, INF), deg(n);
    dist[0] = 0;
    for(int i = 0; i < m; i++){
        adj[u[i]].eb(v[i], i);
        adj[v[i]].eb(u[i], i);
        deg[u[i]] ++, deg[v[i]] ++;
    }
    vector<int> color(m, -1);
    vector<int> bd(n);
    bd[0] = 0;
    queue<pll> q;
    q.push({0, 0});
    if(a >= 3){
        while(!q.empty()){
            auto [pos, lst] = q.front(); q.pop();
            for(auto [x, id] : adj[pos]){
                if(color[id] != -1) continue;
                if(dist[x] != INF){
                  if(dist[x] >= dist[pos]) color[id] = (lst + 1) % a;
                  else color[id] = lst;
                  continue;
                }
                // cout<<"do : "<<pos<<" "<<x<<" "<<lst<<"\n";
                dist[x] = dist[pos] + 1;
                color[id] = (lst + 1) % a;
                q.push({x, color[id]});
            }
        }
        // cout<<"dist : ";
        // for(auto x : dist) cout<<x<<" ";
        // cout<<"\n";
    }
    else{
        string ck = "121221";
        while(!q.empty()){
            auto [pos, lst] = q.front(); q.pop();
            int put;
            if(deg[pos] > 2){
                if(ck[lst] == '1') put = 1;
                else put = 0;
            }
            else put = (lst + 1) % 6;
            for(auto [x, id] : adj[pos]){
                if(dist[x] != INF) continue;
                dist[x] = dist[pos] + 1;
                color[id] = (ck[put] - '1');
                q.push({x, put});
            }
        }
    }
    return color;
}

// signed main(void){
//     int n, m, a, b, s;
//     cin>>n>>m>>a>>b>>s;
//     vector<int> u(m), v(m);
//     for(int i = 0; i < m; i++) cin>>u[i]>>v[i];
//     auto c = Mark(n, m, a, b, u, v);
//     for(auto x : c) cout<<x<<" ";
//     cout<<"\n";
// }
#include "Catherine.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;

int A, B, lst = -1, ok = 0;
string ck = "";
string s = "010110010110";

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

int find_dir(){
  for(int i = 0; i < 6; i++){
    int dif = 0;
    for(int j = 0; j < 5; j++) if(ck[j] != s[i + j]){
      dif = 1;
      break;
    }
    if(!dif) return 1;
  }
  return 0;
}
int Move(vector<int> y){
  // cout<<"ck : "<<A<<" "<<B<<"\n";
  if(lst != -1) y[lst]++;
  int deg = 0;
  for(auto x : y) deg += (x != 0);
  if(A >= 3){
      if(deg == 1){
          return max_element(y.begin(), y.end()) - y.begin();
      }
      for(int i = 0; i < A; i++){
          // cout<<"try : "<<i<<" "<<y[i]<<" "<<y[(i + 1) % A]<<"\n";
          if(y[i] && y[(i + 1) % A]){
              return i;
          }
      }
  }
  // a = 2
  deg = accumulate(y.begin(), y.end(), 0);
  // cout<<"deg : "<<deg<<"\n";
  if(deg == 1){
    // cout<<"nothing, back\n";
    ok = 1;
    if(lst == -1){
      lst = (y[0] == 0);
      return lst;
    }
    else return -1;
  }
  if(deg > 2){
      ok = 1;
      if(y[0] == 1){
        int tmp = lst;
        lst = 0;
        if(tmp == 0) return -1;
        return 0;
      }
      else{
        int tmp = lst;
        lst = 1;
        if(tmp == 1) return -1;
        return 1;
      }
  }
  // deg = 2
  if(ok){
    y[lst]--;
    if(y[0]){
      lst = 0;
      return 0;
    }
    lst = 1;
    return 1;
  }
  auto rot = [&]() -> int{
    int d = find_dir();
    // cout<<"end, change dir : "<<d<<"\n";
    ok = 1;
    if(d){
      return -1;
    }
    y[lst] --;
    if(y[0]){
      lst = 0;
      return 0;
    }
    else{
      lst = 1;
      return 1;
    }
  };
  if(lst == -1){
    if(y[0] == 2){
      ck += "00", lst = 0;
      return 0;
    }
    else if(y[1] == 2){
      ck += "11", lst = 1;
      return 1;
    }
    else{
      ck += "01", lst = 1;
      return 1;
    }
  }
  else{
    y[lst] --;
    if(y[0]){
      ck += '0';
      if(ck.size() == 5) return rot();
      lst = 0;
      return 0;
    }
    else{
      ck += '1';
      if(ck.size() == 5) return rot();
      lst = 1;
      return 1;
    }
  }
}
/*
16 15 2 6 11
0 1
1 2
2 3
3 4
4 8
2 5 
5 6
6 7
7 9
6 10
10 11
11 12
12 13
13 14
13 15
*/

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 15492 KB Output is correct
2 Correct 0 ms 792 KB Output is correct
3 Correct 24 ms 14952 KB Output is correct
4 Correct 36 ms 16572 KB Output is correct
5 Correct 37 ms 16524 KB Output is correct
6 Correct 35 ms 15228 KB Output is correct
7 Correct 28 ms 15128 KB Output is correct
8 Correct 33 ms 15856 KB Output is correct
9 Correct 34 ms 15908 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 15492 KB Output is correct
2 Correct 0 ms 792 KB Output is correct
3 Correct 24 ms 14952 KB Output is correct
4 Correct 36 ms 16572 KB Output is correct
5 Correct 37 ms 16524 KB Output is correct
6 Correct 35 ms 15228 KB Output is correct
7 Correct 28 ms 15128 KB Output is correct
8 Correct 33 ms 15856 KB Output is correct
9 Correct 34 ms 15908 KB Output is correct
10 Correct 26 ms 13440 KB Output is correct
11 Correct 27 ms 13388 KB Output is correct
12 Correct 26 ms 13284 KB Output is correct
13 Correct 26 ms 13292 KB Output is correct
14 Correct 26 ms 13544 KB Output is correct
15 Correct 28 ms 13800 KB Output is correct
16 Correct 30 ms 16004 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 12924 KB Output is correct
2 Correct 1 ms 792 KB Output is correct
3 Correct 25 ms 12676 KB Output is correct
4 Correct 33 ms 14456 KB Output is correct
5 Correct 34 ms 14468 KB Output is correct
6 Correct 35 ms 12912 KB Output is correct
7 Correct 26 ms 12924 KB Output is correct
8 Correct 30 ms 13956 KB Output is correct
9 Correct 30 ms 13700 KB Output is correct
10 Correct 28 ms 13676 KB Output is correct
11 Correct 26 ms 13412 KB Output is correct
12 Correct 30 ms 13436 KB Output is correct
13 Correct 27 ms 13512 KB Output is correct
14 Correct 31 ms 13696 KB Output is correct
15 Correct 33 ms 13688 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 12924 KB Output is correct
2 Correct 1 ms 792 KB Output is correct
3 Correct 25 ms 12676 KB Output is correct
4 Correct 33 ms 14456 KB Output is correct
5 Correct 34 ms 14468 KB Output is correct
6 Correct 35 ms 12912 KB Output is correct
7 Correct 26 ms 12924 KB Output is correct
8 Correct 30 ms 13956 KB Output is correct
9 Correct 30 ms 13700 KB Output is correct
10 Correct 28 ms 13676 KB Output is correct
11 Correct 26 ms 13412 KB Output is correct
12 Correct 30 ms 13436 KB Output is correct
13 Correct 27 ms 13512 KB Output is correct
14 Correct 31 ms 13696 KB Output is correct
15 Correct 33 ms 13688 KB Output is correct
16 Correct 24 ms 11288 KB Output is correct
17 Correct 24 ms 11400 KB Output is correct
18 Correct 30 ms 11384 KB Output is correct
19 Correct 24 ms 11416 KB Output is correct
20 Correct 26 ms 12004 KB Output is correct
21 Correct 31 ms 11756 KB Output is correct
22 Correct 28 ms 13960 KB Output is correct
23 Correct 24 ms 11504 KB Output is correct
24 Correct 26 ms 11500 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1040 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 0 ms 1044 KB Output is correct
4 Correct 1 ms 1552 KB Output is correct
5 Correct 2 ms 1044 KB Output is correct
6 Correct 2 ms 1296 KB Output is correct
7 Correct 2 ms 1304 KB Output is correct
8 Incorrect 2 ms 1048 KB Wrong Answer [5]
9 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 11128 KB Output is correct
2 Correct 30 ms 11712 KB Output is correct
3 Correct 1 ms 792 KB Output is correct
4 Correct 22 ms 11136 KB Output is correct
5 Correct 33 ms 12288 KB Output is correct
6 Incorrect 25 ms 11356 KB Wrong Answer [5]
7 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 11184 KB Output is correct
2 Correct 25 ms 11648 KB Output is correct
3 Correct 0 ms 792 KB Output is correct
4 Correct 22 ms 11132 KB Output is correct
5 Correct 31 ms 12420 KB Output is correct
6 Incorrect 24 ms 11368 KB Wrong Answer [5]
7 Halted 0 ms 0 KB -