제출 #513246

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
513246		wiwiho	길고양이 (JOI20_stray)	C++14	15 / 100	48 ms	16028 KiB

Anthony

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

#define mp make_pair
#define F first
#define S second
#define iter(a) a.begin(), a.end()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(iter(a), greater<>())
#define eb emplace_back
#define printv(a, b) { \
    for(auto pv : a) b << pv << " "; \
    b << "\n"; \
}

using namespace std;

namespace {

}  // namespace

vector<int> Mark(int n, int m, int A, int B,
                      vector<int> U, vector<int> V) {

    assert(A >= 3);
    vector<int> ans(m);

    vector<vector<int>> g(n);
    for(int i = 0; i < m; i++){
        int u = U[i], v = V[i];
        g[u].eb(v);
        g[v].eb(u);
    }

    vector<int> dis(n, -1);
    dis[0] = 0;
    queue<int> q;
    q.push(0);
    
    while(!q.empty()){
        int now = q.front();
        q.pop();
        for(int i : g[now]){
            if(dis[i] != -1) continue;
            dis[i] = dis[now] + 1;
            q.push(i);
        }
    }

    for(int i = 0; i < m; i++){
        int u = U[i], v = V[i];
        if(dis[u] > dis[v]) swap(u, v);
        int t = dis[u] == dis[v] ? dis[v] + 1 : dis[v];
        t %= 3;
        ans[i] = t;
    }

    return ans;
}

Catherine

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

#define mp make_pair
#define F first
#define S second
#define iter(a) a.begin(), a.end()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(iter(a), greater<>())
#define eb emplace_back
#define printv(a, b) { \
    for(auto pv : a) b << pv << " "; \
    b << "\n"; \
}

using namespace std;

namespace {

int A, B;

}  // namespace

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

int Move(vector<int> y) {
    
    vector<int> t;
    for(int i = 0; i < A; i++){
        if(y[i]) t.eb(i);
    }

    if(t.size() == 1) return t[0];

    if(t[0] == 0 && t[1] == 2) return 2;
    return t[0];

}

• Subtask 1: 2 / 2
• Subtask 2: 2 / 2
• Subtask 3: 2 / 2
• Subtask 4: 9 / 9
• Subtask 5: 0 / 5
• Subtask 6: 0 / 71
• Subtask 7: 0 / 9