oj.uz

답안 #947466

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
947466 2024-03-16T08:38:05 Z phoenix0423 길고양이 (JOI20_stray) C++17
20 / 100
 39 ms 16528 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, bk = 0;
int fir = 0;
string ck = "";
string s = "121221121221";

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;
        else 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;
      fir = 0;
      return 0;
    }
    else if(y[1] == 2){
      ck += "11", lst = 1;
      fir = 1;
      return 1;
    }
    else{
      ck += "01", lst = 1;
      fir = 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

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 15420 KB Output is correct
2 Correct 1 ms 780 KB Output is correct
3 Correct 26 ms 14984 KB Output is correct
4 Correct 35 ms 16520 KB Output is correct
5 Correct 36 ms 16528 KB Output is correct
6 Correct 28 ms 15232 KB Output is correct
7 Correct 28 ms 15152 KB Output is correct
8 Correct 34 ms 15992 KB Output is correct
9 Correct 32 ms 15988 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 15420 KB Output is correct
2 Correct 1 ms 780 KB Output is correct
3 Correct 26 ms 14984 KB Output is correct
4 Correct 35 ms 16520 KB Output is correct
5 Correct 36 ms 16528 KB Output is correct
6 Correct 28 ms 15232 KB Output is correct
7 Correct 28 ms 15152 KB Output is correct
8 Correct 34 ms 15992 KB Output is correct
9 Correct 32 ms 15988 KB Output is correct
10 Correct 24 ms 13404 KB Output is correct
11 Correct 26 ms 13428 KB Output is correct
12 Correct 25 ms 13288 KB Output is correct
13 Correct 25 ms 13308 KB Output is correct
14 Correct 26 ms 13628 KB Output is correct
15 Correct 27 ms 13804 KB Output is correct
16 Correct 31 ms 16440 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 13012 KB Output is correct
2 Correct 0 ms 792 KB Output is correct
3 Correct 22 ms 12636 KB Output is correct
4 Correct 34 ms 14696 KB Output is correct
5 Correct 32 ms 14464 KB Output is correct
6 Correct 27 ms 12952 KB Output is correct
7 Correct 26 ms 12984 KB Output is correct
8 Correct 30 ms 13704 KB Output is correct
9 Correct 30 ms 13688 KB Output is correct
10 Correct 30 ms 13548 KB Output is correct
11 Correct 28 ms 13440 KB Output is correct
12 Correct 28 ms 13664 KB Output is correct
13 Correct 30 ms 13364 KB Output is correct
14 Correct 28 ms 13696 KB Output is correct
15 Correct 37 ms 14036 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 13012 KB Output is correct
2 Correct 0 ms 792 KB Output is correct
3 Correct 22 ms 12636 KB Output is correct
4 Correct 34 ms 14696 KB Output is correct
5 Correct 32 ms 14464 KB Output is correct
6 Correct 27 ms 12952 KB Output is correct
7 Correct 26 ms 12984 KB Output is correct
8 Correct 30 ms 13704 KB Output is correct
9 Correct 30 ms 13688 KB Output is correct
10 Correct 30 ms 13548 KB Output is correct
11 Correct 28 ms 13440 KB Output is correct
12 Correct 28 ms 13664 KB Output is correct
13 Correct 30 ms 13364 KB Output is correct
14 Correct 28 ms 13696 KB Output is correct
15 Correct 37 ms 14036 KB Output is correct
16 Correct 24 ms 11404 KB Output is correct
17 Correct 24 ms 11352 KB Output is correct
18 Correct 25 ms 11344 KB Output is correct
19 Correct 24 ms 11248 KB Output is correct
20 Correct 26 ms 12004 KB Output is correct
21 Correct 25 ms 11764 KB Output is correct
22 Correct 27 ms 13956 KB Output is correct
23 Correct 28 ms 11504 KB Output is correct
24 Correct 24 ms 11500 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1292 KB Output is correct
2 Correct 0 ms 792 KB Output is correct
3 Correct 2 ms 1036 KB Output is correct
4 Correct 1 ms 1052 KB Output is correct
5 Correct 1 ms 1040 KB Output is correct
6 Correct 2 ms 1036 KB Output is correct
7 Correct 2 ms 1048 KB Output is correct
8 Correct 2 ms 1044 KB Output is correct
9 Correct 1 ms 1052 KB Output is correct
10 Correct 2 ms 1052 KB Output is correct
11 Correct 2 ms 1044 KB Output is correct
12 Correct 2 ms 1052 KB Output is correct
13 Correct 2 ms 1044 KB Output is correct
14 Correct 2 ms 1048 KB Output is correct
15 Correct 2 ms 1052 KB Output is correct
16 Correct 1 ms 1052 KB Output is correct
17 Correct 0 ms 1052 KB Output is correct
18 Correct 2 ms 1044 KB Output is correct
19 Correct 2 ms 1052 KB Output is correct
20 Correct 1 ms 1036 KB Output is correct
21 Correct 2 ms 1048 KB Output is correct
22 Correct 2 ms 1048 KB Output is correct
23 Correct 2 ms 1048 KB Output is correct
24 Correct 1 ms 1052 KB Output is correct
25 Correct 2 ms 1052 KB Output is correct
26 Correct 1 ms 1052 KB Output is correct
27 Correct 2 ms 1052 KB Output is correct
28 Correct 2 ms 1052 KB Output is correct

Subtask #6
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 11188 KB Output is correct
2 Correct 26 ms 11652 KB Output is correct
3 Correct 0 ms 772 KB Output is correct
4 Correct 22 ms 11124 KB Output is correct
5 Correct 30 ms 12380 KB Output is correct
6 Correct 31 ms 12424 KB Output is correct
7 Correct 26 ms 11388 KB Output is correct
8 Correct 26 ms 11396 KB Output is correct
9 Correct 32 ms 12324 KB Output is correct
10 Correct 30 ms 12408 KB Output is correct
11 Correct 28 ms 12428 KB Output is correct
12 Correct 39 ms 12444 KB Output is correct
13 Correct 30 ms 12308 KB Output is correct
14 Correct 30 ms 12412 KB Output is correct
15 Correct 36 ms 12400 KB Output is correct
16 Correct 30 ms 12336 KB Output is correct
17 Correct 28 ms 12172 KB Output is correct
18 Incorrect 27 ms 12152 KB Wrong Answer [6]
19 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 11180 KB Output is correct
2 Correct 29 ms 11652 KB Output is correct
3 Correct 0 ms 776 KB Output is correct
4 Correct 20 ms 11108 KB Output is correct
5 Correct 32 ms 12316 KB Output is correct
6 Incorrect 33 ms 12412 KB Wrong Answer [6]
7 Halted 0 ms 0 KB -