oj.uz

Submission #563856

# Submission time Handle Problem Language Result Execution time Memory
563856 2022-05-18T07:33:23 Z errorgorn Wild Boar (JOI18_wild_boar) C++17
12 / 100
 18000 ms 98460 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ii pair<int,int>
#define i3 tuple<int,int,int>
#define i4 tuple<int,int,int,int>
#define fi first
#define se second
//#define endl '\n'

#define puf push_front
#define pof pop_front
#define pub push_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound

#define rep(x,s,e) for (int x=(s)-((s)>(e));x!=(e)-((s)>(e));((s)<(e)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int) (x).size()

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n,m,l,q;
struct E{ int to,w,id; };
vector<E> al[2005];

vector<ii> w[2005]; //ok so we store the best 2 guys...
priority_queue<i4,vector<i4>,greater<i4> > pq;

void add(int i,ii val){
	if (w[i][0]==val || w[i][1]==val) return; //prevent from inserting dupes
	
	//cout<<i<<" "<<val.fi<<" "<<val.se<<endl;
	//rep(x,0,2) cout<<w[i][x].fi<<" "<<w[i][x].se<<endl;
	
	if (val.fi<w[i][0].fi){
		if (val.fi!=w[i][0].fi){
			swap(w[i][0],w[i][1]);
			pq.push({w[i][1].fi,w[i][1].se,i,1});
		}
		w[i][0]=val;
		pq.push({w[i][0].fi,w[i][0].se,i,0});
	}
	else if (val.fi<w[i][1].fi && w[i][0].se!=val.se){
		w[i][1]=val;
		pq.push({w[i][1].fi,w[i][1].se,i,1});
	}
	
	assert(w[i][0].se!=w[i][1].se);
}

struct dat{
	vector<i3> res;
	dat(){};
	dat (vector<i3> temp){ //pick best 4
		map<int,int> m1,m2;
		set<ii> s;
		sort(all(temp));
		
		for (auto [w,a,b]:temp){
			if (m1[a]==2 || m2[b]==2 || s.count({a,b})) continue;
			m1[a]++,m2[b]++;
			s.insert({a,b});
			res.pub({w,a,b});
			if (sz(res)==100) break;
		}
	}
};

dat merge(dat i,dat j){
	vector<i3> temp;
	for (auto [w,id1,id2]:i.res) for (auto [w2,id3,id4]:j.res){
		if (id2!=id3) temp.pub({w+w2,id1,id4}); 
	}
	return dat(temp);
}

vector<i3> v[2005];
dat trans[2005][2005];
int arr[100005];

signed main(){
	cin.tie(0);
	cout.tie(0);
	cin.sync_with_stdio(false);
	
	cin>>n>>m>>q>>l;
	
	int a,b,c;
	rep(x,0,m){
		cin>>a>>b>>c;
		al[a].pub({b,c,x});
		al[b].pub({a,c,x});
	}
	
	rep(x,1,n+1){
		rep(y,1,n+1) v[y].clear();
		
		for (auto [y,_W,id]:al[x]){
			rep(x,1,n+1){
				w[x].clear();
				rep(y,1,3) w[x].pub({1e18,-y});
			}
			add(y,{_W,id});
			
			while (!pq.empty()){
				int W,id,u,pos;
				tie(W,id,u,pos)=pq.top(),pq.pop();
				if (w[u][pos]!=ii(W,id)) continue;
				
				for (auto [it,w2,id2]:al[u]) if (id!=id2){
					add(it,{W+w2,id2});
				}
			}
			
			rep(y,1,n+1) for (auto [w,id2]:w[y]) if (w<1e18){
				v[y].pub({w,id,id2});
			}
		}
		
		rep(y,1,n+1) trans[x][y]=dat(v[y]);
	}
	
	rep(x,1,l+1) cin>>arr[x];
	
	while (q--){
		cin>>a>>b;
		arr[a]=b;
		
		//rep(x,1,l+1) cout<<arr[x]<<" "; cout<<endl;
		dat ans=trans[arr[1]][arr[2]];
		rep(x,2,l){
			ans=merge(ans,trans[arr[x]][arr[x+1]]);
			//cout<<x<<":"<<endl;
			//for (auto [w,id,id2]:ans.res) cout<<w<<" "<<id<<" "<<id2<<endl;
		}
		if (ans.res.empty()) cout<<"-1"<<endl;
		else cout<<get<0>(ans.res[0])<<endl;
	}
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 94796 KB Output is correct
2 Correct 50 ms 94820 KB Output is correct
3 Correct 45 ms 94816 KB Output is correct
4 Correct 45 ms 94804 KB Output is correct
5 Correct 47 ms 94800 KB Output is correct
6 Correct 46 ms 94804 KB Output is correct
7 Correct 51 ms 94784 KB Output is correct
8 Correct 46 ms 94856 KB Output is correct
9 Correct 57 ms 94820 KB Output is correct
10 Correct 53 ms 94796 KB Output is correct
11 Correct 46 ms 94804 KB Output is correct
12 Correct 46 ms 94856 KB Output is correct
13 Correct 52 ms 94820 KB Output is correct
14 Correct 46 ms 94856 KB Output is correct
15 Correct 45 ms 94764 KB Output is correct
16 Correct 45 ms 94796 KB Output is correct
17 Correct 43 ms 94796 KB Output is correct
18 Correct 45 ms 94856 KB Output is correct
19 Correct 43 ms 94784 KB Output is correct
20 Correct 44 ms 94752 KB Output is correct
21 Correct 45 ms 94796 KB Output is correct
22 Correct 45 ms 94796 KB Output is correct
23 Correct 44 ms 94860 KB Output is correct
24 Correct 45 ms 94792 KB Output is correct
25 Correct 45 ms 94768 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 94796 KB Output is correct
2 Correct 50 ms 94820 KB Output is correct
3 Correct 45 ms 94816 KB Output is correct
4 Correct 45 ms 94804 KB Output is correct
5 Correct 47 ms 94800 KB Output is correct
6 Correct 46 ms 94804 KB Output is correct
7 Correct 51 ms 94784 KB Output is correct
8 Correct 46 ms 94856 KB Output is correct
9 Correct 57 ms 94820 KB Output is correct
10 Correct 53 ms 94796 KB Output is correct
11 Correct 46 ms 94804 KB Output is correct
12 Correct 46 ms 94856 KB Output is correct
13 Correct 52 ms 94820 KB Output is correct
14 Correct 46 ms 94856 KB Output is correct
15 Correct 45 ms 94764 KB Output is correct
16 Correct 45 ms 94796 KB Output is correct
17 Correct 43 ms 94796 KB Output is correct
18 Correct 45 ms 94856 KB Output is correct
19 Correct 43 ms 94784 KB Output is correct
20 Correct 44 ms 94752 KB Output is correct
21 Correct 45 ms 94796 KB Output is correct
22 Correct 45 ms 94796 KB Output is correct
23 Correct 44 ms 94860 KB Output is correct
24 Correct 45 ms 94792 KB Output is correct
25 Correct 45 ms 94768 KB Output is correct
26 Correct 46 ms 94860 KB Output is correct
27 Correct 64 ms 96372 KB Output is correct
28 Correct 63 ms 96244 KB Output is correct
29 Correct 252 ms 98164 KB Output is correct
30 Correct 1182 ms 97768 KB Output is correct
31 Execution timed out 18068 ms 98460 KB Time limit exceeded
32 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 94796 KB Output is correct
2 Correct 50 ms 94820 KB Output is correct
3 Correct 45 ms 94816 KB Output is correct
4 Correct 45 ms 94804 KB Output is correct
5 Correct 47 ms 94800 KB Output is correct
6 Correct 46 ms 94804 KB Output is correct
7 Correct 51 ms 94784 KB Output is correct
8 Correct 46 ms 94856 KB Output is correct
9 Correct 57 ms 94820 KB Output is correct
10 Correct 53 ms 94796 KB Output is correct
11 Correct 46 ms 94804 KB Output is correct
12 Correct 46 ms 94856 KB Output is correct
13 Correct 52 ms 94820 KB Output is correct
14 Correct 46 ms 94856 KB Output is correct
15 Correct 45 ms 94764 KB Output is correct
16 Correct 45 ms 94796 KB Output is correct
17 Correct 43 ms 94796 KB Output is correct
18 Correct 45 ms 94856 KB Output is correct
19 Correct 43 ms 94784 KB Output is correct
20 Correct 44 ms 94752 KB Output is correct
21 Correct 45 ms 94796 KB Output is correct
22 Correct 45 ms 94796 KB Output is correct
23 Correct 44 ms 94860 KB Output is correct
24 Correct 45 ms 94792 KB Output is correct
25 Correct 45 ms 94768 KB Output is correct
26 Correct 46 ms 94860 KB Output is correct
27 Correct 64 ms 96372 KB Output is correct
28 Correct 63 ms 96244 KB Output is correct
29 Correct 252 ms 98164 KB Output is correct
30 Correct 1182 ms 97768 KB Output is correct
31 Execution timed out 18068 ms 98460 KB Time limit exceeded
32 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 94796 KB Output is correct
2 Correct 50 ms 94820 KB Output is correct
3 Correct 45 ms 94816 KB Output is correct
4 Correct 45 ms 94804 KB Output is correct
5 Correct 47 ms 94800 KB Output is correct
6 Correct 46 ms 94804 KB Output is correct
7 Correct 51 ms 94784 KB Output is correct
8 Correct 46 ms 94856 KB Output is correct
9 Correct 57 ms 94820 KB Output is correct
10 Correct 53 ms 94796 KB Output is correct
11 Correct 46 ms 94804 KB Output is correct
12 Correct 46 ms 94856 KB Output is correct
13 Correct 52 ms 94820 KB Output is correct
14 Correct 46 ms 94856 KB Output is correct
15 Correct 45 ms 94764 KB Output is correct
16 Correct 45 ms 94796 KB Output is correct
17 Correct 43 ms 94796 KB Output is correct
18 Correct 45 ms 94856 KB Output is correct
19 Correct 43 ms 94784 KB Output is correct
20 Correct 44 ms 94752 KB Output is correct
21 Correct 45 ms 94796 KB Output is correct
22 Correct 45 ms 94796 KB Output is correct
23 Correct 44 ms 94860 KB Output is correct
24 Correct 45 ms 94792 KB Output is correct
25 Correct 45 ms 94768 KB Output is correct
26 Correct 46 ms 94860 KB Output is correct
27 Correct 64 ms 96372 KB Output is correct
28 Correct 63 ms 96244 KB Output is correct
29 Correct 252 ms 98164 KB Output is correct
30 Correct 1182 ms 97768 KB Output is correct
31 Execution timed out 18068 ms 98460 KB Time limit exceeded
32 Halted 0 ms 0 KB -