oj.uz

Submission #132258

# Submission time Handle Problem Language Result Execution time Memory
132258 2019-07-18T15:19:53 Z gs14004 Wild Boar (JOI18_wild_boar) C++17
12 / 100
 294 ms 226552 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2005;
const int MAXL = 100005;
using lint = long long;
using pi = pair<lint, int>;

struct edg{
	int pos, idx, cost;
};

struct node{
	int pos, num;
	lint cost;
	int from;
	bool operator<(const node &n)const{
		return cost > n.cost;
	}
};

int n, m, q, l;
vector<edg> gph[MAXN];
lint dist[MAXN * 2][MAXN * 2];

struct path_info{
	int midl, midr;
	lint cost;
	bool operator<(const path_info &p)const{
		return cost < p.cost;
	}
};

vector<path_info> plist[MAXN][MAXN];
int ed[MAXN * 2], cost[MAXN * 2];

void preprocess(){
	for(int i=0; i<m; i++){
		int s, e, x; scanf("%d %d %d",&s,&e,&x);
		ed[2 * i] = e; ed[2 * i + 1] = s;
		cost[2 * i] = cost[2 * i + 1] = x;
		gph[s].push_back({e, i*2, x});
		gph[e].push_back({s, i*2+1, x});
	}
	memset(dist, 0x3f, sizeof(dist));
	for(int i=0; i<2*m; i++){
		dist[i][i] = cost[i];
		priority_queue<pi, vector<pi>, greater<pi> > pq;
		pq.emplace(cost[i], i);
		while(!pq.empty()){
			auto x = pq.top(); pq.pop();
			if(dist[i][x.second] != x.first) continue;
			for(auto &j : gph[ed[x.second]]){
				if((j.idx ^ x.second) == 1) continue;
				if(dist[i][j.idx] > x.first + j.cost){
					dist[i][j.idx] = x.first + j.cost;
					pq.emplace(dist[i][j.idx], j.idx);
				}
			}
		}
	}
	for(int i=1; i<=n; i++){
		for(int j=1; j<=n; j++){
			if(i != j){
				vector<path_info> pth;
				for(auto &k : gph[i]){
					for(auto &l : gph[j]){
						lint cost = dist[k.idx][l.idx ^ 1];
						pth.push_back({k.pos, l.pos, cost});
					}
				}
				sort(pth.begin(), pth.end());
				if(pth.size() <= 2){
					plist[i][j] = pth;
					continue;
				}
				plist[i][j].push_back(pth[0]);
				plist[i][j].push_back(pth[1]);
				if(pth[0].midl != pth[1].midl && pth[0].midr != pth[1].midr){
					plist[i][j].push_back(pth[2]);
					pi nxt_punkty = pi(-1, -1);
					if(pi(pth[0].midl, pth[1].midr) == pi(pth[2].midl, pth[2].midr)){
						nxt_punkty = pi(pth[1].midl, pth[0].midr);
					}
					else if(pi(pth[1].midl, pth[0].midr) == pi(pth[2].midl, pth[2].midr)){
						nxt_punkty = pi(pth[0].midl, pth[1].midr);
					}
					else if(pth[2].midl == pth[1].midl){
						nxt_punkty = pi(pth[2].midl, pth[0].midr);
					}
					else if(pth[2].midl == pth[0].midl){
						nxt_punkty = pi(pth[2].midl, pth[1].midr);
					}
					else if(pth[2].midr == pth[1].midr){
						nxt_punkty = pi(pth[0].midl, pth[2].midr);
					}
					else if(pth[2].midr == pth[0].midr){
						nxt_punkty = pi(pth[1].midl, pth[2].midr);
					}
					for(int k = 3; k < pth.size(); k++){
						plist[i][j].push_back(pth[k]);
						if(nxt_punkty != pi(pth[k].midl, pth[k].midr)){
							break;
						}
					}
				}
				else if(pth[0].midl == pth[1].midl){
					for(int x = 0; x < pth.size(); x++){
						if(pth[x].midl != pth[0].midl){
							plist[i][j].push_back(pth[x]);
							for(int y = x + 1; y < pth.size(); y++){
								if(pi(pth[0].midl, pth[x].midr) != pi(pth[y].midl, pth[y].midr)){
									plist[i][j].push_back(pth[y]);
									break;
								}
							}
							break;
						}
					}
				}
				else if(pth[0].midr == pth[1].midr){
					for(int x = 0; x < pth.size(); x++){
						if(pth[x].midr != pth[0].midr){
							plist[i][j].push_back(pth[x]);
							for(int y = x + 1; y < pth.size(); y++){
								if(pi(pth[x].midl, pth[0].midr) != pi(pth[y].midl, pth[y].midr)){
									plist[i][j].push_back(pth[y]);
									break;
								}
							}
							break;
						}
					}
				}
				else assert(0);
			//	for(auto &k : plist[i][j]) printf("(%d -> %d), (%d -> %d), %lld\n", i, k.midl, k.midr, j, k.cost);
			}
		}
	}
}

int a[MAXL];
lint dp[MAXL][6];

int main(){
	scanf("%d %d %d %d",&n,&m,&q,&l);
	preprocess();
	for(int i=0; i<l; i++) scanf("%d",&a[i]);
	for(int i=0; i<q; i++){
		int x, v; scanf("%d %d",&x,&v);
		x--;
		a[x] = v;
		memset(dp, 0x3f, sizeof(dp));
		for(int k=0; k<plist[a[0]][a[1]].size(); k++){
			dp[1][k] = plist[a[0]][a[1]][k].cost;
		}
		for(int k=2; k<l; k++){
			for(int x = 0; x < plist[a[k - 2]][a[k - 1]].size(); x++){
				for(int y = 0; y < plist[a[k - 1]][a[k]].size(); y++){
					if(plist[a[k - 2]][a[k - 1]][x].midr != plist[a[k - 1]][a[k]][y].midl){
						dp[k][y] = min(dp[k][y], dp[k - 1][x] + plist[a[k - 1]][a[k]][y].cost);
					}
				}
			}
		}
		int w = plist[a[l - 2]][a[l - 1]].size();
		lint dap = *min_element(dp[l - 1], dp[l - 1] + w);
		if(dap > 9e17) dap = -1;
		printf("%lld\n", dap);
	}
}

Compilation message

wild_boar.cpp: In function 'void preprocess()':
wild_boar.cpp:99:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for(int k = 3; k < pth.size(); k++){
                     ~~^~~~~~~~~~~~
wild_boar.cpp:107:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for(int x = 0; x < pth.size(); x++){
                     ~~^~~~~~~~~~~~
wild_boar.cpp:110:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
        for(int y = x + 1; y < pth.size(); y++){
                           ~~^~~~~~~~~~~~
wild_boar.cpp:121:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for(int x = 0; x < pth.size(); x++){
                     ~~^~~~~~~~~~~~
wild_boar.cpp:124:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
        for(int y = x + 1; y < pth.size(); y++){
                           ~~^~~~~~~~~~~~
wild_boar.cpp: In function 'int main()':
wild_boar.cpp:153:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int k=0; k<plist[a[0]][a[1]].size(); k++){
                ~^~~~~~~~~~~~~~~~~~~~~~~~~
wild_boar.cpp:157:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int x = 0; x < plist[a[k - 2]][a[k - 1]].size(); x++){
                   ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
wild_boar.cpp:158:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int y = 0; y < plist[a[k - 1]][a[k]].size(); y++){
                    ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
wild_boar.cpp: In function 'void preprocess()':
wild_boar.cpp:38:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int s, e, x; scanf("%d %d %d",&s,&e,&x);
                ~~~~~^~~~~~~~~~~~~~~~~~~~~
wild_boar.cpp: In function 'int main()':
wild_boar.cpp:145:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d %d",&n,&m,&q,&l);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
wild_boar.cpp:147:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0; i<l; i++) scanf("%d",&a[i]);
                         ~~~~~^~~~~~~~~~~~
wild_boar.cpp:149:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int x, v; scanf("%d %d",&x,&v);
             ~~~~~^~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 225536 KB Output is correct
2 Correct 193 ms 225400 KB Output is correct
3 Correct 191 ms 225372 KB Output is correct
4 Correct 196 ms 225400 KB Output is correct
5 Correct 200 ms 225488 KB Output is correct
6 Correct 191 ms 225300 KB Output is correct
7 Correct 193 ms 225272 KB Output is correct
8 Correct 191 ms 225400 KB Output is correct
9 Correct 203 ms 225272 KB Output is correct
10 Correct 192 ms 225400 KB Output is correct
11 Correct 194 ms 225432 KB Output is correct
12 Correct 195 ms 225396 KB Output is correct
13 Correct 193 ms 225392 KB Output is correct
14 Correct 191 ms 225272 KB Output is correct
15 Correct 193 ms 225400 KB Output is correct
16 Correct 192 ms 225384 KB Output is correct
17 Correct 192 ms 225356 KB Output is correct
18 Correct 192 ms 225272 KB Output is correct
19 Correct 194 ms 225412 KB Output is correct
20 Correct 193 ms 225304 KB Output is correct
21 Correct 192 ms 225364 KB Output is correct
22 Correct 194 ms 225412 KB Output is correct
23 Correct 192 ms 225400 KB Output is correct
24 Correct 191 ms 225272 KB Output is correct
25 Correct 191 ms 225272 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 225536 KB Output is correct
2 Correct 193 ms 225400 KB Output is correct
3 Correct 191 ms 225372 KB Output is correct
4 Correct 196 ms 225400 KB Output is correct
5 Correct 200 ms 225488 KB Output is correct
6 Correct 191 ms 225300 KB Output is correct
7 Correct 193 ms 225272 KB Output is correct
8 Correct 191 ms 225400 KB Output is correct
9 Correct 203 ms 225272 KB Output is correct
10 Correct 192 ms 225400 KB Output is correct
11 Correct 194 ms 225432 KB Output is correct
12 Correct 195 ms 225396 KB Output is correct
13 Correct 193 ms 225392 KB Output is correct
14 Correct 191 ms 225272 KB Output is correct
15 Correct 193 ms 225400 KB Output is correct
16 Correct 192 ms 225384 KB Output is correct
17 Correct 192 ms 225356 KB Output is correct
18 Correct 192 ms 225272 KB Output is correct
19 Correct 194 ms 225412 KB Output is correct
20 Correct 193 ms 225304 KB Output is correct
21 Correct 192 ms 225364 KB Output is correct
22 Correct 194 ms 225412 KB Output is correct
23 Correct 192 ms 225400 KB Output is correct
24 Correct 191 ms 225272 KB Output is correct
25 Correct 191 ms 225272 KB Output is correct
26 Correct 193 ms 225480 KB Output is correct
27 Correct 220 ms 226376 KB Output is correct
28 Correct 215 ms 226296 KB Output is correct
29 Incorrect 294 ms 226552 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 225536 KB Output is correct
2 Correct 193 ms 225400 KB Output is correct
3 Correct 191 ms 225372 KB Output is correct
4 Correct 196 ms 225400 KB Output is correct
5 Correct 200 ms 225488 KB Output is correct
6 Correct 191 ms 225300 KB Output is correct
7 Correct 193 ms 225272 KB Output is correct
8 Correct 191 ms 225400 KB Output is correct
9 Correct 203 ms 225272 KB Output is correct
10 Correct 192 ms 225400 KB Output is correct
11 Correct 194 ms 225432 KB Output is correct
12 Correct 195 ms 225396 KB Output is correct
13 Correct 193 ms 225392 KB Output is correct
14 Correct 191 ms 225272 KB Output is correct
15 Correct 193 ms 225400 KB Output is correct
16 Correct 192 ms 225384 KB Output is correct
17 Correct 192 ms 225356 KB Output is correct
18 Correct 192 ms 225272 KB Output is correct
19 Correct 194 ms 225412 KB Output is correct
20 Correct 193 ms 225304 KB Output is correct
21 Correct 192 ms 225364 KB Output is correct
22 Correct 194 ms 225412 KB Output is correct
23 Correct 192 ms 225400 KB Output is correct
24 Correct 191 ms 225272 KB Output is correct
25 Correct 191 ms 225272 KB Output is correct
26 Correct 193 ms 225480 KB Output is correct
27 Correct 220 ms 226376 KB Output is correct
28 Correct 215 ms 226296 KB Output is correct
29 Incorrect 294 ms 226552 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 225536 KB Output is correct
2 Correct 193 ms 225400 KB Output is correct
3 Correct 191 ms 225372 KB Output is correct
4 Correct 196 ms 225400 KB Output is correct
5 Correct 200 ms 225488 KB Output is correct
6 Correct 191 ms 225300 KB Output is correct
7 Correct 193 ms 225272 KB Output is correct
8 Correct 191 ms 225400 KB Output is correct
9 Correct 203 ms 225272 KB Output is correct
10 Correct 192 ms 225400 KB Output is correct
11 Correct 194 ms 225432 KB Output is correct
12 Correct 195 ms 225396 KB Output is correct
13 Correct 193 ms 225392 KB Output is correct
14 Correct 191 ms 225272 KB Output is correct
15 Correct 193 ms 225400 KB Output is correct
16 Correct 192 ms 225384 KB Output is correct
17 Correct 192 ms 225356 KB Output is correct
18 Correct 192 ms 225272 KB Output is correct
19 Correct 194 ms 225412 KB Output is correct
20 Correct 193 ms 225304 KB Output is correct
21 Correct 192 ms 225364 KB Output is correct
22 Correct 194 ms 225412 KB Output is correct
23 Correct 192 ms 225400 KB Output is correct
24 Correct 191 ms 225272 KB Output is correct
25 Correct 191 ms 225272 KB Output is correct
26 Correct 193 ms 225480 KB Output is correct
27 Correct 220 ms 226376 KB Output is correct
28 Correct 215 ms 226296 KB Output is correct
29 Incorrect 294 ms 226552 KB Output isn't correct
30 Halted 0 ms 0 KB -