oj.uz

Submission #468119

# Submission time Handle Problem Language Result Execution time Memory
468119 2021-08-26T16:12:16 Z PedroBigMan Wiring (IOI17_wiring) C++14
100 / 100
 55 ms 23612 KB 
#include "wiring.h"
/*
Author of all code: Pedro BIGMAN Dias
Last edit: 15/02/2021
*/
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <list>
#include <iomanip>
#include <stdlib.h>
#include <time.h>
#include <cstring>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=(ll) a; i<(ll) b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define whole(x) x.begin(),x.end()
#define DEBUG(i) cout<<"Pedro Is The Master "<<i<<endl
#define INF 5000000000000000LL
#define EPS 0.00000001
#define pi 3.14159
ll mod=1000000007LL;

template<class A=ll> 
void Out(vector<A> a) {REP(i,0,a.size()) {cout<<a[i]<<" ";} cout<<endl;}

template<class A=ll>
void In(vector<A> &a, ll N) {A cur; REP(i,0,N) {cin>>cur; a.pb(cur);}} 

vector<ll> dp;
vector<ll> ps;

ll f(ll s)
{
	if(s==-1LL) {return 0LL;}
	else {return dp[s];}
}

ll PS(ll a, ll b)
{
	if(a==0) {return ps[b];} else {return (ps[b]-ps[a-1]);}
}

ll min_total_length(vector<int> r, vector<int> b) 
{
	vector<pl> a;
	ll cntA=0LL, cntB=0LL;
	while(cntA<r.size() || cntB<b.size())
	{
		if(cntA==r.size()) {a.pb({b[cntB],1}); cntB++;}
		else if(cntB==b.size()) {a.pb({r[cntA],0}); cntA++;}
		else if(b[cntB]>r[cntA]) {a.pb({r[cntA],0}); cntA++;}
		else {a.pb({b[cntB],1}); cntB++;}
	}
	ll N = a.size(); REP(i,0,N) {dp.pb(INF);}
	ll cursum=0LL; REP(i,0,N) {cursum+=a[i].ff; ps.pb(cursum);}
	vector<pl> lastblock; pl cur={-1,-1};
	REP(i,0,N)
	{
		if(i>0 && a[i].ss!=a[i-1].ss) 
		{
			cur={lastblock.back().ss+1,i-1};
		}
		lastblock.pb(cur);
	}
	ll len, len1, len2;
	ll A,B,C;
	vector<ll> val1,val2; REP(i,0,N) {val1.pb(INF); val2.pb(INF);}
	vector<ll> minright1, minleft2; REP(i,0,N) {minright1.pb(INF); minleft2.pb(INF);}
	ll curmin1,curmin2;
	REP(i,0,N)
	{
		A = lastblock[i].ff; B = lastblock[i].ss+1; C = i;
		if(A==B-1LL && A>=0LL)
		{
			dp[i]=min(dp[i],min(f(A),f(A-1))+PS(B,C)-(C-A)*a[A].ff);
		}
		else if(A>=0LL)
		{
			len1=INF; len2=INF;
			ll pos1 = max(A,2LL*B-C-1LL); ll pos2=min(B-1,pos1-1LL);
			if(pos1<B) {len1=minright1[pos1];}
			if(pos2>=A) {len2=minleft2[pos2];}
			dp[i]=min(dp[i],len1 + PS(B,C) - (C+1LL-2LL*B)*a[B-1].ff);
			dp[i]=min(dp[i],len2 + PS(B,C) - (C+1LL-2LL*B)*a[B].ff);
		}
		if(i!=N-1 && a[i+1].ss!=a[i].ss)
		{
			A = lastblock[i+1].ff; B = lastblock[i+1].ss +1;
			curmin1=INF; curmin2=INF;
			REP(x,A,B)
			{
				val1[x]= f(x-1) - PS(x,B-1) - x*a[B-1].ff;
				val2[x]= f(x-1) - PS(x,B-1) - x*a[B].ff;
			}
			REP(x,A,B)
			{
				curmin2=min(curmin2,val2[x]); minleft2[x]=curmin2;
			}
			for(ll x = B-1; x>=A; x--) 
			{
				curmin1=min(curmin1,val1[x]); minright1[x]=curmin1;
			}
		}
	}
	return dp[N-1];
}

Compilation message

wiring.cpp:6: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    6 | #pragma GCC optimization ("O3")
      | 
wiring.cpp:7: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    7 | #pragma GCC optimization ("unroll-loops")
      | 
wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:66:12: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |  while(cntA<r.size() || cntB<b.size())
      |        ~~~~^~~~~~~~~
wiring.cpp:66:29: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |  while(cntA<r.size() || cntB<b.size())
      |                         ~~~~^~~~~~~~~
wiring.cpp:68:10: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |   if(cntA==r.size()) {a.pb({b[cntB],1}); cntB++;}
      |      ~~~~^~~~~~~~~~
wiring.cpp:69:15: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |   else if(cntB==b.size()) {a.pb({r[cntA],0}); cntA++;}
      |           ~~~~^~~~~~~~~~
wiring.cpp:84:5: warning: unused variable 'len' [-Wunused-variable]
   84 |  ll len, len1, len2;
      |     ^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 36 ms 17240 KB Output is correct
4 Correct 38 ms 17328 KB Output is correct
5 Correct 37 ms 17252 KB Output is correct
6 Correct 47 ms 21668 KB Output is correct
7 Correct 46 ms 21668 KB Output is correct
8 Correct 46 ms 21648 KB Output is correct
9 Correct 46 ms 21664 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 50 ms 21676 KB Output is correct
4 Correct 49 ms 21552 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 49 ms 21552 KB Output is correct
19 Correct 50 ms 21532 KB Output is correct
20 Correct 50 ms 21652 KB Output is correct
21 Correct 49 ms 21620 KB Output is correct
22 Correct 50 ms 21540 KB Output is correct
23 Correct 51 ms 21536 KB Output is correct
24 Correct 53 ms 21520 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 46 ms 21560 KB Output is correct
3 Correct 46 ms 21552 KB Output is correct
4 Correct 45 ms 21660 KB Output is correct
5 Correct 55 ms 21652 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 48 ms 21668 KB Output is correct
19 Correct 46 ms 21552 KB Output is correct
20 Correct 44 ms 21572 KB Output is correct
21 Correct 44 ms 21660 KB Output is correct
22 Correct 45 ms 21668 KB Output is correct
23 Correct 45 ms 21664 KB Output is correct
24 Correct 44 ms 21664 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 36 ms 17240 KB Output is correct
20 Correct 38 ms 17328 KB Output is correct
21 Correct 37 ms 17252 KB Output is correct
22 Correct 47 ms 21668 KB Output is correct
23 Correct 46 ms 21668 KB Output is correct
24 Correct 46 ms 21648 KB Output is correct
25 Correct 46 ms 21664 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 50 ms 21676 KB Output is correct
29 Correct 49 ms 21552 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 49 ms 21552 KB Output is correct
44 Correct 50 ms 21532 KB Output is correct
45 Correct 50 ms 21652 KB Output is correct
46 Correct 49 ms 21620 KB Output is correct
47 Correct 50 ms 21540 KB Output is correct
48 Correct 51 ms 21536 KB Output is correct
49 Correct 53 ms 21520 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Correct 46 ms 21560 KB Output is correct
52 Correct 46 ms 21552 KB Output is correct
53 Correct 45 ms 21660 KB Output is correct
54 Correct 55 ms 21652 KB Output is correct
55 Correct 1 ms 204 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 0 ms 204 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 1 ms 204 KB Output is correct
62 Correct 0 ms 204 KB Output is correct
63 Correct 0 ms 204 KB Output is correct
64 Correct 0 ms 204 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 1 ms 204 KB Output is correct
67 Correct 48 ms 21668 KB Output is correct
68 Correct 46 ms 21552 KB Output is correct
69 Correct 44 ms 21572 KB Output is correct
70 Correct 44 ms 21660 KB Output is correct
71 Correct 45 ms 21668 KB Output is correct
72 Correct 45 ms 21664 KB Output is correct
73 Correct 44 ms 21664 KB Output is correct
74 Correct 49 ms 23568 KB Output is correct
75 Correct 48 ms 23216 KB Output is correct
76 Correct 49 ms 23612 KB Output is correct
77 Correct 47 ms 23060 KB Output is correct
78 Correct 45 ms 22936 KB Output is correct
79 Correct 45 ms 22936 KB Output is correct
80 Correct 44 ms 23020 KB Output is correct
81 Correct 45 ms 23064 KB Output is correct
82 Correct 45 ms 23060 KB Output is correct
83 Correct 46 ms 23124 KB Output is correct
84 Correct 47 ms 23600 KB Output is correct
85 Correct 51 ms 23508 KB Output is correct
86 Correct 48 ms 23532 KB Output is correct
87 Correct 47 ms 23548 KB Output is correct
88 Correct 48 ms 23600 KB Output is correct
89 Correct 52 ms 23532 KB Output is correct
90 Correct 49 ms 23480 KB Output is correct
91 Correct 48 ms 23568 KB Output is correct
92 Correct 48 ms 23472 KB Output is correct
93 Correct 48 ms 23512 KB Output is correct
94 Correct 49 ms 23576 KB Output is correct
95 Correct 49 ms 23568 KB Output is correct
96 Correct 47 ms 23560 KB Output is correct
97 Correct 48 ms 23596 KB Output is correct
98 Correct 49 ms 23560 KB Output is correct
99 Correct 49 ms 23572 KB Output is correct
100 Correct 49 ms 23600 KB Output is correct
101 Correct 49 ms 23568 KB Output is correct
102 Correct 48 ms 23600 KB Output is correct