oj.uz

Submission #101897

# Submission time Handle Problem Language Result Execution time Memory
101897 2019-03-21T00:54:35 Z briansu Wiring (IOI17_wiring) C++14
13 / 100
 101 ms 16396 KB 
#include "wiring.h"

//{
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(i,n) memset(i,n,sizeof i)
#define X first
#define Y second
#define SZ(_a) (int)_a.size()
#define ALL(_a) _a.begin(),_a.end()
#define pb push_back
#ifdef brian
#define debug(...) do{\
    fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<" ,";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,multiset<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif // brian
//}


const ll MAXn=2e5+5,MAXlg=__lg(MAXn)+2;
const ll MOD=1000000007;
const ll INF=ll(1e15);

ll dp[MAXn];

long long min_total_length(std::vector<int> r, std::vector<int> b) {
	vector<ii> v;
	for(ll x:r)v.pb(ii(x, 0));
	for(ll x:b)v.pb(ii(x, 1));
	sort(ALL(v));
	vector<ii> x, y;
	int it;
	for(it = 0;v[it].Y == v[0].Y;it++)x.pb({v[it].X, it+1});
	dp[0] = 0;
	REP1(i, SZ(v))dp[i] = INF;
	while(it != SZ(v))
	{
		ll lst = it;
		for(;it != SZ(v) && v[it].Y == v[lst].Y;it++)y.pb({v[it].X, it+1});
		sort(ALL(x), [](ii a,ii b){return a.X > b.X;});
		sort(ALL(y), [](ii a,ii b){return a.X < b.X;});
		debug(x, y);
		REP1(i, SZ(x) - 1)x[i].X += x[i-1].X;
		multiset<ll> st;
		for(int i = 0;i < SZ(x);i ++)st.insert(y[0].X * (i + 1) - x[i].X + dp[x[i].Y - 1]);
		ll mn = INF, s = 0;
		for(int i = 0;i < SZ(y);i ++)
		{
			if(i < SZ(x))st.erase(st.lower_bound(y[0].X * (i + 1) - x[i].X + dp[x[i].Y - 1])), mn = min(mn, dp[x[i].Y - 1] + x[0].X * (i+1) - x[i].X);
			debug(i, mn, st);
			s += y[i].X;
			dp[y[i].Y] = mn + s - (i+1) * x[0].X;
			if(SZ(st))dp[y[i].Y] = min(dp[y[i].Y], (*st.begin()) + s - (i+1) * y[0].X);
		}
		x = y;
		y.clear();
	}
	REP1(i, SZ(v))debug(i, dp[i]);
	return dp[SZ(v)];	
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 3 ms 384 KB 3rd lines differ - on the 1st token, expected: '14340', found: '14694'
3 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 72 ms 13792 KB Output is correct
4 Correct 75 ms 13764 KB Output is correct
5 Correct 56 ms 12512 KB Output is correct
6 Correct 85 ms 16324 KB Output is correct
7 Correct 87 ms 16352 KB Output is correct
8 Correct 101 ms 16396 KB Output is correct
9 Correct 87 ms 16344 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 304 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Incorrect 73 ms 8668 KB 3rd lines differ - on the 1st token, expected: '1068938599', found: '1152497305'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 80 ms 8640 KB Output is correct
3 Correct 65 ms 8040 KB Output is correct
4 Correct 87 ms 8288 KB Output is correct
5 Correct 101 ms 8032 KB Output is correct
6 Incorrect 2 ms 300 KB 3rd lines differ - on the 1st token, expected: '42', found: '43'
7 Halted 0 ms 0 KB -

Subtask #5
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 3 ms 384 KB 3rd lines differ - on the 1st token, expected: '14340', found: '14694'
3 Halted 0 ms 0 KB -