oj.uz

Submission #947432

# Submission time Handle Problem Language Result Execution time Memory
947432 2024-03-16T07:12:35 Z phoenix0423 Stray Cat (JOI20_stray) C++17
4 / 100
 36 ms 16600 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, move = 0, ok = 0;
string ps = "";

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

int Move(vector<int> y){
    // cout<<"ck : "<<A<<" "<<B<<"\n";
    if(lst != -1) y[lst]++;
    int deg = accumulate(y.begin(), y.end(), 0);
    if(deg == 1){
        return max_element(y.begin(), y.end()) - y.begin();
    }
    if(true){
        for(int i = 0; i < A; i++){
            // cout<<"try : "<<y[i]<<" "<<y[(i + 1) % A]<<"\n";
            if(y[i] && y[(i + 1) % A]){
                return i;
            }
        }
    }
    return 0;
    if(deg > 2){
        if(lst) return lst ^ 1;
        else return y[0] != 1;
    }
    if(ok){

    }
}
/*
7 6 3 6 1
0 2
0 4
1 2
1 3
1 5
4 6
*/

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 15488 KB Output is correct
2 Correct 0 ms 792 KB Output is correct
3 Correct 24 ms 15008 KB Output is correct
4 Correct 35 ms 16496 KB Output is correct
5 Correct 34 ms 16600 KB Output is correct
6 Correct 33 ms 15236 KB Output is correct
7 Correct 31 ms 15268 KB Output is correct
8 Correct 36 ms 16000 KB Output is correct
9 Correct 33 ms 15924 KB Output is correct

Subtask #2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 15488 KB Output is correct
2 Correct 0 ms 792 KB Output is correct
3 Correct 24 ms 15008 KB Output is correct
4 Correct 35 ms 16496 KB Output is correct
5 Correct 34 ms 16600 KB Output is correct
6 Correct 33 ms 15236 KB Output is correct
7 Correct 31 ms 15268 KB Output is correct
8 Correct 36 ms 16000 KB Output is correct
9 Correct 33 ms 15924 KB Output is correct
10 Correct 26 ms 13352 KB Output is correct
11 Incorrect 24 ms 13432 KB Wrong Answer [5]
12 Halted 0 ms 0 KB -

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 12924 KB Output is correct
2 Correct 0 ms 792 KB Output is correct
3 Correct 28 ms 12680 KB Output is correct
4 Correct 34 ms 14284 KB Output is correct
5 Correct 34 ms 14464 KB Output is correct
6 Correct 26 ms 12980 KB Output is correct
7 Correct 26 ms 12984 KB Output is correct
8 Correct 31 ms 13588 KB Output is correct
9 Correct 32 ms 13692 KB Output is correct
10 Correct 32 ms 13364 KB Output is correct
11 Correct 28 ms 13428 KB Output is correct
12 Correct 30 ms 13432 KB Output is correct
13 Correct 33 ms 13512 KB Output is correct
14 Correct 32 ms 13708 KB Output is correct
15 Correct 30 ms 13684 KB Output is correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 12924 KB Output is correct
2 Correct 0 ms 792 KB Output is correct
3 Correct 28 ms 12680 KB Output is correct
4 Correct 34 ms 14284 KB Output is correct
5 Correct 34 ms 14464 KB Output is correct
6 Correct 26 ms 12980 KB Output is correct
7 Correct 26 ms 12984 KB Output is correct
8 Correct 31 ms 13588 KB Output is correct
9 Correct 32 ms 13692 KB Output is correct
10 Correct 32 ms 13364 KB Output is correct
11 Correct 28 ms 13428 KB Output is correct
12 Correct 30 ms 13432 KB Output is correct
13 Correct 33 ms 13512 KB Output is correct
14 Correct 32 ms 13708 KB Output is correct
15 Correct 30 ms 13684 KB Output is correct
16 Correct 26 ms 11396 KB Output is correct
17 Incorrect 22 ms 11520 KB Wrong Answer [5]
18 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

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

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 11188 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 11132 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -