oj.uz

답안 #563864

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
563864 2022-05-18T07:41:00 Z errorgorn Wild Boar (JOI18_wild_boar) C++17
100 / 100
 9764 ms 499916 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});
	}
}

struct dat{
	vector<i3> res;
	dat(){};
	dat (vector<i3> temp){ //pick best 5
		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)==5) 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];

struct node{
	int s,e,m;
	dat val;
	node *l,*r;
	
	node (int _s,int _e){
		s=_s,e=_e,m=s+e>>1;
		
		if (s!=e){
			l=new node(s,m);
			r=new node(m+1,e);
			
			val=merge(l->val,r->val);
		}
		else{
			val=trans[arr[s]][arr[s+1]];
		}
	}
	
	void update(int i){
		if (s==e) val=trans[arr[i]][arr[i+1]];
		else{
			if (i<=m) l->update(i);
			else r->update(i);
			val=merge(l->val,r->val);
		}
	}
} *root;

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];
	root=new node(1,l-1);
	
	while (q--){
		cin>>a>>b;
		arr[a]=b;
		
		if (a!=1) root->update(a-1);
		if (a!=l) root->update(a);
		
		if (root->val.res.empty()) cout<<"-1"<<endl;
		else cout<<get<0>(root->val.res[0])<<endl;
	}
}

Compilation message

wild_boar.cpp: In constructor 'node::node(long long int, long long int)':
wild_boar.cpp:88:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   88 |   s=_s,e=_e,m=s+e>>1;
      |               ~^~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 94800 KB Output is correct
2 Correct 63 ms 94796 KB Output is correct
3 Correct 56 ms 94784 KB Output is correct
4 Correct 51 ms 94932 KB Output is correct
5 Correct 55 ms 94852 KB Output is correct
6 Correct 52 ms 94808 KB Output is correct
7 Correct 52 ms 94768 KB Output is correct
8 Correct 50 ms 94768 KB Output is correct
9 Correct 52 ms 94868 KB Output is correct
10 Correct 51 ms 94784 KB Output is correct
11 Correct 52 ms 94832 KB Output is correct
12 Correct 50 ms 94836 KB Output is correct
13 Correct 50 ms 94796 KB Output is correct
14 Correct 50 ms 94752 KB Output is correct
15 Correct 51 ms 94800 KB Output is correct
16 Correct 51 ms 94764 KB Output is correct
17 Correct 49 ms 94848 KB Output is correct
18 Correct 52 ms 94796 KB Output is correct
19 Correct 50 ms 94804 KB Output is correct
20 Correct 50 ms 94828 KB Output is correct
21 Correct 51 ms 94804 KB Output is correct
22 Correct 50 ms 94824 KB Output is correct
23 Correct 50 ms 94796 KB Output is correct
24 Correct 51 ms 94804 KB Output is correct
25 Correct 52 ms 94824 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 94800 KB Output is correct
2 Correct 63 ms 94796 KB Output is correct
3 Correct 56 ms 94784 KB Output is correct
4 Correct 51 ms 94932 KB Output is correct
5 Correct 55 ms 94852 KB Output is correct
6 Correct 52 ms 94808 KB Output is correct
7 Correct 52 ms 94768 KB Output is correct
8 Correct 50 ms 94768 KB Output is correct
9 Correct 52 ms 94868 KB Output is correct
10 Correct 51 ms 94784 KB Output is correct
11 Correct 52 ms 94832 KB Output is correct
12 Correct 50 ms 94836 KB Output is correct
13 Correct 50 ms 94796 KB Output is correct
14 Correct 50 ms 94752 KB Output is correct
15 Correct 51 ms 94800 KB Output is correct
16 Correct 51 ms 94764 KB Output is correct
17 Correct 49 ms 94848 KB Output is correct
18 Correct 52 ms 94796 KB Output is correct
19 Correct 50 ms 94804 KB Output is correct
20 Correct 50 ms 94828 KB Output is correct
21 Correct 51 ms 94804 KB Output is correct
22 Correct 50 ms 94824 KB Output is correct
23 Correct 50 ms 94796 KB Output is correct
24 Correct 51 ms 94804 KB Output is correct
25 Correct 52 ms 94824 KB Output is correct
26 Correct 53 ms 94860 KB Output is correct
27 Correct 91 ms 116480 KB Output is correct
28 Correct 87 ms 115700 KB Output is correct
29 Correct 295 ms 141904 KB Output is correct
30 Correct 308 ms 143760 KB Output is correct
31 Correct 293 ms 144496 KB Output is correct
32 Correct 296 ms 145104 KB Output is correct
33 Correct 292 ms 140500 KB Output is correct
34 Correct 319 ms 140316 KB Output is correct
35 Correct 281 ms 147780 KB Output is correct
36 Correct 318 ms 145508 KB Output is correct
37 Correct 333 ms 141520 KB Output is correct
38 Correct 301 ms 139712 KB Output is correct
39 Correct 339 ms 147976 KB Output is correct
40 Correct 295 ms 139948 KB Output is correct
41 Correct 291 ms 139700 KB Output is correct
42 Correct 309 ms 150848 KB Output is correct
43 Correct 299 ms 140672 KB Output is correct
44 Correct 307 ms 140688 KB Output is correct
45 Correct 208 ms 129428 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 94800 KB Output is correct
2 Correct 63 ms 94796 KB Output is correct
3 Correct 56 ms 94784 KB Output is correct
4 Correct 51 ms 94932 KB Output is correct
5 Correct 55 ms 94852 KB Output is correct
6 Correct 52 ms 94808 KB Output is correct
7 Correct 52 ms 94768 KB Output is correct
8 Correct 50 ms 94768 KB Output is correct
9 Correct 52 ms 94868 KB Output is correct
10 Correct 51 ms 94784 KB Output is correct
11 Correct 52 ms 94832 KB Output is correct
12 Correct 50 ms 94836 KB Output is correct
13 Correct 50 ms 94796 KB Output is correct
14 Correct 50 ms 94752 KB Output is correct
15 Correct 51 ms 94800 KB Output is correct
16 Correct 51 ms 94764 KB Output is correct
17 Correct 49 ms 94848 KB Output is correct
18 Correct 52 ms 94796 KB Output is correct
19 Correct 50 ms 94804 KB Output is correct
20 Correct 50 ms 94828 KB Output is correct
21 Correct 51 ms 94804 KB Output is correct
22 Correct 50 ms 94824 KB Output is correct
23 Correct 50 ms 94796 KB Output is correct
24 Correct 51 ms 94804 KB Output is correct
25 Correct 52 ms 94824 KB Output is correct
26 Correct 53 ms 94860 KB Output is correct
27 Correct 91 ms 116480 KB Output is correct
28 Correct 87 ms 115700 KB Output is correct
29 Correct 295 ms 141904 KB Output is correct
30 Correct 308 ms 143760 KB Output is correct
31 Correct 293 ms 144496 KB Output is correct
32 Correct 296 ms 145104 KB Output is correct
33 Correct 292 ms 140500 KB Output is correct
34 Correct 319 ms 140316 KB Output is correct
35 Correct 281 ms 147780 KB Output is correct
36 Correct 318 ms 145508 KB Output is correct
37 Correct 333 ms 141520 KB Output is correct
38 Correct 301 ms 139712 KB Output is correct
39 Correct 339 ms 147976 KB Output is correct
40 Correct 295 ms 139948 KB Output is correct
41 Correct 291 ms 139700 KB Output is correct
42 Correct 309 ms 150848 KB Output is correct
43 Correct 299 ms 140672 KB Output is correct
44 Correct 307 ms 140688 KB Output is correct
45 Correct 208 ms 129428 KB Output is correct
46 Correct 226 ms 102136 KB Output is correct
47 Correct 2216 ms 185504 KB Output is correct
48 Correct 2946 ms 230688 KB Output is correct
49 Correct 3563 ms 272292 KB Output is correct
50 Correct 3528 ms 277752 KB Output is correct
51 Correct 3526 ms 278640 KB Output is correct
52 Correct 3936 ms 303320 KB Output is correct
53 Correct 3749 ms 302324 KB Output is correct
54 Correct 3776 ms 302076 KB Output is correct
55 Correct 3874 ms 299284 KB Output is correct
56 Correct 4635 ms 323028 KB Output is correct
57 Correct 5616 ms 348528 KB Output is correct
58 Correct 4760 ms 367948 KB Output is correct
59 Correct 4977 ms 391424 KB Output is correct
60 Correct 5232 ms 413420 KB Output is correct
61 Correct 5418 ms 436912 KB Output is correct
62 Correct 6163 ms 464548 KB Output is correct
63 Correct 6745 ms 495172 KB Output is correct
64 Correct 3830 ms 374600 KB Output is correct
65 Correct 3888 ms 374712 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 94800 KB Output is correct
2 Correct 63 ms 94796 KB Output is correct
3 Correct 56 ms 94784 KB Output is correct
4 Correct 51 ms 94932 KB Output is correct
5 Correct 55 ms 94852 KB Output is correct
6 Correct 52 ms 94808 KB Output is correct
7 Correct 52 ms 94768 KB Output is correct
8 Correct 50 ms 94768 KB Output is correct
9 Correct 52 ms 94868 KB Output is correct
10 Correct 51 ms 94784 KB Output is correct
11 Correct 52 ms 94832 KB Output is correct
12 Correct 50 ms 94836 KB Output is correct
13 Correct 50 ms 94796 KB Output is correct
14 Correct 50 ms 94752 KB Output is correct
15 Correct 51 ms 94800 KB Output is correct
16 Correct 51 ms 94764 KB Output is correct
17 Correct 49 ms 94848 KB Output is correct
18 Correct 52 ms 94796 KB Output is correct
19 Correct 50 ms 94804 KB Output is correct
20 Correct 50 ms 94828 KB Output is correct
21 Correct 51 ms 94804 KB Output is correct
22 Correct 50 ms 94824 KB Output is correct
23 Correct 50 ms 94796 KB Output is correct
24 Correct 51 ms 94804 KB Output is correct
25 Correct 52 ms 94824 KB Output is correct
26 Correct 53 ms 94860 KB Output is correct
27 Correct 91 ms 116480 KB Output is correct
28 Correct 87 ms 115700 KB Output is correct
29 Correct 295 ms 141904 KB Output is correct
30 Correct 308 ms 143760 KB Output is correct
31 Correct 293 ms 144496 KB Output is correct
32 Correct 296 ms 145104 KB Output is correct
33 Correct 292 ms 140500 KB Output is correct
34 Correct 319 ms 140316 KB Output is correct
35 Correct 281 ms 147780 KB Output is correct
36 Correct 318 ms 145508 KB Output is correct
37 Correct 333 ms 141520 KB Output is correct
38 Correct 301 ms 139712 KB Output is correct
39 Correct 339 ms 147976 KB Output is correct
40 Correct 295 ms 139948 KB Output is correct
41 Correct 291 ms 139700 KB Output is correct
42 Correct 309 ms 150848 KB Output is correct
43 Correct 299 ms 140672 KB Output is correct
44 Correct 307 ms 140688 KB Output is correct
45 Correct 208 ms 129428 KB Output is correct
46 Correct 226 ms 102136 KB Output is correct
47 Correct 2216 ms 185504 KB Output is correct
48 Correct 2946 ms 230688 KB Output is correct
49 Correct 3563 ms 272292 KB Output is correct
50 Correct 3528 ms 277752 KB Output is correct
51 Correct 3526 ms 278640 KB Output is correct
52 Correct 3936 ms 303320 KB Output is correct
53 Correct 3749 ms 302324 KB Output is correct
54 Correct 3776 ms 302076 KB Output is correct
55 Correct 3874 ms 299284 KB Output is correct
56 Correct 4635 ms 323028 KB Output is correct
57 Correct 5616 ms 348528 KB Output is correct
58 Correct 4760 ms 367948 KB Output is correct
59 Correct 4977 ms 391424 KB Output is correct
60 Correct 5232 ms 413420 KB Output is correct
61 Correct 5418 ms 436912 KB Output is correct
62 Correct 6163 ms 464548 KB Output is correct
63 Correct 6745 ms 495172 KB Output is correct
64 Correct 3830 ms 374600 KB Output is correct
65 Correct 3888 ms 374712 KB Output is correct
66 Correct 231 ms 136664 KB Output is correct
67 Correct 827 ms 129144 KB Output is correct
68 Correct 2263 ms 226892 KB Output is correct
69 Correct 2550 ms 230476 KB Output is correct
70 Correct 2702 ms 250328 KB Output is correct
71 Correct 6725 ms 189000 KB Output is correct
72 Correct 7562 ms 238896 KB Output is correct
73 Correct 7752 ms 308576 KB Output is correct
74 Correct 7715 ms 310104 KB Output is correct
75 Correct 7735 ms 306840 KB Output is correct
76 Correct 9274 ms 271908 KB Output is correct
77 Correct 8127 ms 283132 KB Output is correct
78 Correct 7884 ms 283088 KB Output is correct
79 Correct 8125 ms 352744 KB Output is correct
80 Correct 8362 ms 376592 KB Output is correct
81 Correct 9084 ms 379796 KB Output is correct
82 Correct 8689 ms 419456 KB Output is correct
83 Correct 9764 ms 445208 KB Output is correct
84 Correct 9216 ms 499916 KB Output is correct
85 Correct 6339 ms 378028 KB Output is correct