oj.uz

답안 #1039476

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1039476 2024-07-30T23:53:11 Z Trent Spy 3 (JOI24_spy3) C++17
72 / 100
 273 ms 8248 KB 
#include "Aoi.h"
#include "bits/stdc++.h"
 
using namespace std;
#define forR(i, x) for(int i = 0; i < (x); ++i)
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
#define all(x) x.begin(), x.end()
 
namespace {
	typedef long long ll;
	struct pii{int a, b;};
	bool operator <(pii a, pii b) {return a.a < b.a || a.a == b.a && a.b < b.b;}
	struct edge{int t; ll len;};
	struct node{int i; ll to;};
	bool operator <(node a, node b){
		return a.to > b.to;
	}
	const ll INF = 1e17;
	string toBinNumber(int x, int bits) {
		string ret;
		forR(i, bits) {
			ret.push_back(x % 2 == 0 ? '0' : '1');
			x /= 2;
		}
		reverse(all(ret));
		assert(x == 0);
		return ret;
	}
}
 
std::string aoi(int N, int M, int Q, int K, std::vector<int> A,
                std::vector<int> B, std::vector<long long> C,
                std::vector<int> T, std::vector<int> X) {
	vector<vector<edge>> adj(N);
	map<pii, int> xi;
	forR(i, M){
		adj[A[i]].push_back({B[i], C[i]});
		adj[B[i]].push_back({A[i], C[i]});
	}
	forR(i, K){
		xi.insert({{A[X[i]], B[X[i]]}, i});
		xi.insert({{B[X[i]], A[X[i]]}, i});
	}
 
	vector<int> indIn(K, Q);
	vector<int> lOld(Q);
	// dijkstra
	forR(i, Q){
		vector<ll> dis(N, INF);
		vector<bool> vis(N);
		vector<int> pre(N);
		priority_queue<node> dij;
		dij.push({0, 0});
		dis[0] = 0;
		while(!dij.empty()){
			auto [cur, len] = dij.top();
			dij.pop();
			if(!vis[cur]){
				vis[cur] = true;
				for(auto [to, el] : adj[cur]){
					if(len + el < dis[to]){
						dis[to] = len + el;
						pre[to] = cur;
						dij.push({to, dis[to]});
					}
				}
			}
		}
 
		vector<int> pth;
		for(int j = T[i]; j != 0; j = pre[j]) pth.push_back(j);
		pth.push_back(0);
		reverse(all(pth));
		int lasUsed = -1;
		forR(j, (int) pth.size() - 1) {
			if(xi.count({pth[j], pth[j+1]})) {
				int eInd = xi[{pth[j], pth[j+1]}];
				if(indIn[eInd] == Q) {
					indIn[eInd] = i;
				} else {
					lasUsed = eInd;
				}
			}
		}
		lOld[i] = lasUsed == -1 ? -1 : lasUsed;
	}
    set<int> sUsedX;
    for(int i : lOld) if(i != -1) sUsedX.insert(i);
    vector<int> usedX;
    for(int i : sUsedX) usedX.push_back(i);
 
	for(int i : indIn) cerr << i << ' ';
	cerr << '\n';
	for(int i : lOld) cerr << i << ' ';
	cerr << '\n';

	string ret;
	for(int i : indIn) {
        if(!sUsedX.count(i)) ret += toBinNumber(i, 6);
        else {
            ret += toBinNumber(i + Q + 1, 6);
        }
	}
	for(int i : lOld) {
		ret += toBinNumber(i + 1, 9);
	}
	cerr << ret << '\n';
	return ret;
}
#include "Bitaro.h"
#include "bits/stdc++.h"
 
using namespace std;
#define forR(i, x) for(int i = 0; i < (x); ++i)
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
#define all(x) x.begin(), x.end()
 
namespace {
	typedef long long ll;
	struct pii{int a, b;};
	bool operator <(pii a, pii b) {return a.a < b.a || a.a == b.a && a.b < b.b;}
	struct edge{int t, ind; ll len;};
	struct node{int i; ll to;};
	bool operator <(node a, node b){
		return a.to > b.to;
	}
	const ll INF = 1e17;
	int fromBinNumber(string s) {
		int ret = 0;
		for(char i : s) ret = ret * 2 + (i == '0' ? 0 : 1);
		return ret;
	}
}
 
void bitaro(int N, int M, int Q, int K, std::vector<int> A, std::vector<int> B,
            std::vector<long long> C, std::vector<int> T, std::vector<int> X,
            std::string s) {
	map<pii, int> xi;
	forR(i, K){
		xi.insert({{A[X[i]], B[X[i]]}, i});
		xi.insert({{B[X[i]], A[X[i]]}, i});
	}
 
	vector<vector<edge>> adj(N);
	map<pii, int> ei;
	forR(i, M){
		int cxi = -1;
		if(xi.count({A[i], B[i]})){
			cxi = xi[{A[i], B[i]}];
		}
		adj[A[i]].push_back({B[i], cxi, C[i]});
		adj[B[i]].push_back({A[i], cxi, C[i]});
		ei[{A[i], B[i]}] = i;
		ei[{B[i], A[i]}] = i;
	}
 
	vector<int> indIn;
	vector<int> lOld;
    vector<int> usedX;
	int ci=0;
	forR(i, K) {
        int val = fromBinNumber(s.substr(ci, 6));
        if(val >= Q + 1) {
            usedX.push_back(i);
            indIn.push_back(val - Q - 1);
        } else {
            indIn.push_back(val);
        }
		ci += 6;
	}
	forR(i, Q) {
		lOld.push_back(fromBinNumber(s.substr(ci, 9)) - 1);
		ci += 9;
	}
	for(int i : indIn) cerr << i << ' ';
	cerr << '\n';
	for(int i : lOld) cerr << i << ' ';
	cerr << '\n';
 
	vector<bool> solid(N, false);
	vector<int> sPre(N);
	forR(i, Q){
		vector<ll> dis(N, INF);
		vector<bool> vis(N);
		vector<int> pre(N);
		int stNode;
		if(lOld[i] == -1) stNode = 0;
		else {
			int eInd = X[lOld[i]];
			stNode = sPre[A[eInd]] == B[eInd] ? A[eInd] : B[eInd];
			assert(solid[stNode]);
		}
 
		priority_queue<node> dij;
		dij.push({stNode, 0});
		dis[stNode] = 0;
		while(!dij.empty()){
			auto [cur, len] = dij.top();
			dij.pop();
			if(!vis[cur]){
				vis[cur] = true;
				for(auto [to, ind, el] : adj[cur]){
					if(ind == -1 || indIn[ind] == i){
						el = ind == -1 ? el : 0;
						if(len + el < dis[to]){
							dis[to] = len + el;
							pre[to] = cur;
							dij.push({to, dis[to]});
						}
					}
				}	
			}
		}
		vector<int> pth;
		for(int j = T[i]; j != stNode; j = pre[j]) pth.push_back(j);
		for(int j = stNode; j != 0; j = sPre[j]) pth.push_back(j);
		pth.push_back(0);
		reverse(all(pth));
		for(int j : pth) cerr << j << ' ';
		cerr << '\n';
		REP(j, 1, pth.size()) {
			solid[pth[j]] = true;
			sPre[pth[j]] = pth[j-1];
		}
		vector<int> ret;
		forR(j, (int) pth.size() - 1) ret.push_back(ei[{pth[j], pth[j+1]}]);
		answer(ret);
	}
}

Compilation message

Aoi.cpp: In function 'bool {anonymous}::operator<({anonymous}::pii, {anonymous}::pii)':
Aoi.cpp:12:64: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   12 |  bool operator <(pii a, pii b) {return a.a < b.a || a.a == b.a && a.b < b.b;}
      |                                                     ~~~~~~~~~~~^~~~~~~~~~~~

Bitaro.cpp: In function 'bool {anonymous}::operator<({anonymous}::pii, {anonymous}::pii)':
Bitaro.cpp:12:64: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   12 |  bool operator <(pii a, pii b) {return a.a < b.a || a.a == b.a && a.b < b.b;}
      |                                                     ~~~~~~~~~~~^~~~~~~~~~~~
Bitaro.cpp: In function 'void bitaro(int, int, int, int, std::vector<int>, std::vector<int>, std::vector<long long int>, std::vector<int>, std::vector<int>, std::string)':
Bitaro.cpp:6:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 | #define REP(i, a, b) for(int i = (a); i < (b); ++i)
      |                                         ^
Bitaro.cpp:112:3: note: in expansion of macro 'REP'
  112 |   REP(j, 1, pth.size()) {
      |   ^~~

Subtask #1
72.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 26 ms 6404 KB Partially correct
2 Correct 1 ms 776 KB Output is correct
3 Partially correct 56 ms 7020 KB Partially correct
4 Partially correct 177 ms 6948 KB Partially correct
5 Partially correct 56 ms 6836 KB Partially correct
6 Partially correct 83 ms 7048 KB Partially correct
7 Partially correct 53 ms 6952 KB Partially correct
8 Partially correct 72 ms 6896 KB Partially correct
9 Partially correct 151 ms 6828 KB Partially correct
10 Partially correct 38 ms 6744 KB Partially correct
11 Partially correct 49 ms 7020 KB Partially correct
12 Correct 93 ms 7068 KB Output is correct
13 Correct 61 ms 6836 KB Output is correct
14 Correct 48 ms 7052 KB Output is correct
15 Correct 128 ms 6712 KB Output is correct
16 Correct 32 ms 6584 KB Output is correct
17 Partially correct 265 ms 7148 KB Partially correct
18 Partially correct 273 ms 7092 KB Partially correct
19 Partially correct 66 ms 8092 KB Partially correct
20 Partially correct 53 ms 8096 KB Partially correct
21 Partially correct 63 ms 8084 KB Partially correct
22 Partially correct 73 ms 8152 KB Partially correct
23 Partially correct 58 ms 8100 KB Partially correct
24 Partially correct 78 ms 8100 KB Partially correct
25 Partially correct 195 ms 7196 KB Partially correct
26 Partially correct 205 ms 7064 KB Partially correct
27 Correct 1 ms 776 KB Output is correct
28 Correct 63 ms 7376 KB Output is correct
29 Partially correct 79 ms 5120 KB Partially correct
30 Correct 77 ms 7348 KB Output is correct
31 Correct 39 ms 7444 KB Output is correct
32 Correct 56 ms 7540 KB Output is correct
33 Correct 51 ms 7008 KB Output is correct
34 Correct 102 ms 7500 KB Output is correct
35 Correct 78 ms 7596 KB Output is correct
36 Partially correct 72 ms 7548 KB Partially correct
37 Partially correct 66 ms 4068 KB Partially correct
38 Partially correct 179 ms 5432 KB Partially correct
39 Correct 179 ms 5600 KB Output is correct
40 Correct 24 ms 4664 KB Output is correct
41 Partially correct 67 ms 7852 KB Partially correct
42 Partially correct 51 ms 8020 KB Partially correct
43 Correct 96 ms 8068 KB Output is correct
44 Correct 34 ms 7860 KB Output is correct
45 Partially correct 65 ms 4116 KB Partially correct
46 Partially correct 89 ms 4936 KB Partially correct
47 Correct 98 ms 4892 KB Output is correct
48 Correct 0 ms 776 KB Output is correct
49 Correct 0 ms 776 KB Output is correct
50 Partially correct 22 ms 6324 KB Partially correct
51 Partially correct 3 ms 1040 KB Partially correct
52 Correct 2 ms 776 KB Output is correct
53 Partially correct 27 ms 6428 KB Partially correct
54 Partially correct 17 ms 4364 KB Partially correct
55 Correct 39 ms 5080 KB Output is correct
56 Partially correct 41 ms 7352 KB Partially correct
57 Partially correct 50 ms 7756 KB Partially correct
58 Partially correct 43 ms 6360 KB Partially correct
59 Correct 64 ms 7920 KB Output is correct
60 Partially correct 54 ms 7848 KB Partially correct
61 Partially correct 70 ms 7860 KB Partially correct
62 Correct 66 ms 7488 KB Output is correct
63 Correct 66 ms 7880 KB Output is correct
64 Correct 24 ms 6840 KB Output is correct
65 Correct 39 ms 5400 KB Output is correct
66 Partially correct 37 ms 8224 KB Partially correct
67 Partially correct 40 ms 5368 KB Partially correct
68 Partially correct 39 ms 8248 KB Partially correct
69 Correct 0 ms 776 KB Output is correct
70 Correct 0 ms 772 KB Output is correct
71 Correct 2 ms 776 KB Output is correct
72 Partially correct 18 ms 4116 KB Partially correct
73 Partially correct 38 ms 4672 KB Partially correct
74 Partially correct 32 ms 4632 KB Partially correct
75 Correct 16 ms 4632 KB Output is correct
76 Correct 0 ms 784 KB Output is correct
77 Correct 47 ms 7240 KB Output is correct
78 Partially correct 42 ms 7112 KB Partially correct
79 Correct 62 ms 6984 KB Output is correct
80 Correct 0 ms 780 KB Output is correct
81 Correct 53 ms 6972 KB Output is correct
82 Partially correct 47 ms 6872 KB Partially correct
83 Correct 62 ms 6844 KB Output is correct