답안 #806737

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
806737 2023-08-04T09:23:04 Z thimote75 Wild Boar (JOI18_wild_boar) C++14
47 / 100
5612 ms 1048576 KB
#include <bits/stdc++.h>
#define int long long

using namespace std;

string to_string(string s) { return s; }
template <typename T> string to_string(T v) {
	bool first = true;
	string res = "[";
	for (const auto &x : v) {
		if (!first)
			res += ", ";
		first = false;
		res += to_string(x);
	}
	res += "]";
	return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

void dbg_out() { cout << endl; }
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) {
	cout << ' ' << to_string(H);
	dbg_out(T...);
}

#ifdef DEBUG
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

struct State {
    int source = -1; int target = -1; int distance = 1e18;
    State next (int node, int next, int cost) {
        State st;
        st.source   = source == -1 ? next : source;
        st.distance = cost + distance;
        if (next == target) st.distance = 1e18;
        st.target   = node;

        return st;
    }
    bool operator< (const State &other) const {
        return distance < other.distance;
    }
};
struct CNT {
    map<int, int> m;
    int get (int x) {
        if (m.find(x) == m.end()) return 0;
        return (*m.find(x)).second;
    }
    int pop (int x) {
        if (m.find(x) == m.end()) return 0;
        int res = (*m.find(x)).second; m.erase(x);
        return res;
    }
    void insert (int x) {
        int f = pop(x);
        m.insert({ x, f + 1 });
    }
};

string to_string (State state) {
    if (state.distance == 1e18)
        return "State#";
    return "State[" + to_string(state.source + 1) + " => " + to_string(state.target + 1) + ", " + to_string(state.distance) + "]";
}

struct Matrix {
    vector<State> pcc;
    CNT lst;
    CNT fst;
    set<pair<int, int>> s;
    
    bool append (State state, bool apply = true) {
        if (pcc.size() >= 9) return false;
        if (lst.get(state.target) >= 3) return false;
        if (fst.get(state.source) >= 3) return false;
        if (s.find({ state.source, state.target }) != s.end()) return false;

        if (apply) {
            lst.insert(state.target);
            fst.insert(state.source);
            pcc.push_back(state);
            s.insert({ state.source, state.target });
        }
        return true;
    }

    vector<State> all () {
        return pcc;
    }
    int answer () {
        return pcc.size() == 0 ? -1 : pcc[0].distance;
    }

    Matrix merge (Matrix &other) {
        Matrix res;

        vector<State> all_states;
        for (State s1: all()) {
            for (State s2: other.all()) {
                State s3;
                if (s1.target == s2.source) continue ;

                s3.source   = s1.source;
                s3.target   = s2.target;
                s3.distance = s1.distance + s2.distance;

                all_states.push_back(s3);
            }
        }

        sort(all_states.begin(), all_states.end());
        for (State s : all_states)
            res.append(s);
        
        return res;
    }
};
string to_string (Matrix matrix) {
    return "Mat" + to_string(matrix.all());
}
using vMatrix = vector<Matrix>;
using ti = pair<pair<int, int>, State>;
using pq = priority_queue<ti, vector<ti>, greater<ti>>;
template<typename T>
using grid  = vector<vector<T>>;
using idata = vector<int>;

using graph = grid<pair<int, int>>;

int N, M, T, L;
graph roads;

vMatrix dijkstra (int start) {
    pq q;

    vMatrix matrices(N);
    State startState;
    startState.distance = 0;
    q.push({ { 0, start }, startState });
    
    dbg(start);
    while (q.size() != 0) {
        const auto data = q.top(); q.pop();
        State state = data.second;
        int node = data.first.second;

        //if (state.distance >= 1e18) continue ;

        dbg(node, state.distance);

        if (!matrices[node].append( state )) continue ;
    
        for (const auto & road : roads[node]) {
            int next = road.first; int cost = road.second;

            State nextState = state.next(node, next, cost);
            if (!matrices[next].append(nextState, false)) continue ;

            q.push({ { nextState.distance, next }, nextState });
        }
    }

    return matrices;
}

grid<Matrix> matrixGrid;

signed main () {
    ios_base::sync_with_stdio(false); cin.tie(NULL);

    cin >> N >> M >> T >> L;

    roads.resize(N);
    for (int i = 0; i < M; i ++) {
        int a, b, c;
        cin >> a >> b >> c;
        a --; b --;

        roads[a].push_back({ b, c });
        roads[b].push_back({ a, c });
    }

    for (int i = 0; i < N; i ++)
        matrixGrid.push_back( dijkstra(i) );
    
    idata DV(L);
    for (int i = 0; i < L; i ++) {
        cin >> DV[i];
        DV[i] --;
    }

    for (int i = 0; i < T; i ++) {
        int p, v;
        cin >> p >> v;
        p --;
        v --;

        DV[p] = v;

        Matrix result = matrixGrid[DV[0]][DV[1]];

        dbg(result);

        for (int j = 2; j < L; j ++) {
            dbg(DV[j - 1] + 1, DV[j] + 1);
            result = result.merge(matrixGrid[DV[j - 1]][DV[j]]);
        }

        int answer = result.answer();
        if (answer == 1e18) answer = -1;
        cout << answer << "\n";
    }
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 4 ms 852 KB Output is correct
27 Correct 25 ms 8844 KB Output is correct
28 Correct 25 ms 8792 KB Output is correct
29 Correct 651 ms 17972 KB Output is correct
30 Correct 647 ms 16400 KB Output is correct
31 Correct 534 ms 16552 KB Output is correct
32 Correct 544 ms 16652 KB Output is correct
33 Correct 627 ms 34068 KB Output is correct
34 Correct 649 ms 34376 KB Output is correct
35 Correct 547 ms 30768 KB Output is correct
36 Correct 581 ms 29752 KB Output is correct
37 Correct 681 ms 35476 KB Output is correct
38 Correct 611 ms 49660 KB Output is correct
39 Correct 629 ms 43112 KB Output is correct
40 Correct 499 ms 49980 KB Output is correct
41 Correct 477 ms 49904 KB Output is correct
42 Correct 561 ms 52628 KB Output is correct
43 Correct 420 ms 63340 KB Output is correct
44 Correct 454 ms 63052 KB Output is correct
45 Correct 305 ms 71280 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 4 ms 852 KB Output is correct
27 Correct 25 ms 8844 KB Output is correct
28 Correct 25 ms 8792 KB Output is correct
29 Correct 651 ms 17972 KB Output is correct
30 Correct 647 ms 16400 KB Output is correct
31 Correct 534 ms 16552 KB Output is correct
32 Correct 544 ms 16652 KB Output is correct
33 Correct 627 ms 34068 KB Output is correct
34 Correct 649 ms 34376 KB Output is correct
35 Correct 547 ms 30768 KB Output is correct
36 Correct 581 ms 29752 KB Output is correct
37 Correct 681 ms 35476 KB Output is correct
38 Correct 611 ms 49660 KB Output is correct
39 Correct 629 ms 43112 KB Output is correct
40 Correct 499 ms 49980 KB Output is correct
41 Correct 477 ms 49904 KB Output is correct
42 Correct 561 ms 52628 KB Output is correct
43 Correct 420 ms 63340 KB Output is correct
44 Correct 454 ms 63052 KB Output is correct
45 Correct 305 ms 71280 KB Output is correct
46 Correct 401 ms 61188 KB Output is correct
47 Correct 3589 ms 378016 KB Output is correct
48 Correct 5612 ms 812204 KB Output is correct
49 Runtime error 5221 ms 1048576 KB Execution killed with signal 9
50 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 4 ms 852 KB Output is correct
27 Correct 25 ms 8844 KB Output is correct
28 Correct 25 ms 8792 KB Output is correct
29 Correct 651 ms 17972 KB Output is correct
30 Correct 647 ms 16400 KB Output is correct
31 Correct 534 ms 16552 KB Output is correct
32 Correct 544 ms 16652 KB Output is correct
33 Correct 627 ms 34068 KB Output is correct
34 Correct 649 ms 34376 KB Output is correct
35 Correct 547 ms 30768 KB Output is correct
36 Correct 581 ms 29752 KB Output is correct
37 Correct 681 ms 35476 KB Output is correct
38 Correct 611 ms 49660 KB Output is correct
39 Correct 629 ms 43112 KB Output is correct
40 Correct 499 ms 49980 KB Output is correct
41 Correct 477 ms 49904 KB Output is correct
42 Correct 561 ms 52628 KB Output is correct
43 Correct 420 ms 63340 KB Output is correct
44 Correct 454 ms 63052 KB Output is correct
45 Correct 305 ms 71280 KB Output is correct
46 Correct 401 ms 61188 KB Output is correct
47 Correct 3589 ms 378016 KB Output is correct
48 Correct 5612 ms 812204 KB Output is correct
49 Runtime error 5221 ms 1048576 KB Execution killed with signal 9
50 Halted 0 ms 0 KB -