oj.uz

Submission #240727

# Submission time Handle Problem Language Result Execution time Memory
240727 2020-06-21T01:22:26 Z tleontest1 Boxes with souvenirs (IOI15_boxes) C++14
10 / 100
 5 ms 384 KB 
#include "boxes.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx2")
 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long lo;
typedef pair< lo,lo > PII;
 
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
 
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
 
int m,b[li],flag,t;
lo cev;
string s;
set<int> st,st1;
 
long long delivery(int n, int k, int l, int a[]) {
	for(int i=0;i<n;i++){
		cev+=min(l-a[i],a[i])*2;
	}
	if(k==1)return cev;
	cev=0;
	for(int i=0;i<n;i++){
		if(a[i]<l/2)st.insert(a[i]);
		else st1.insert(a[i]);
	}
	while((int)st.size()>=k){
		int say=0;
		while(say<k-1){say++;st.erase(st.begin());}
		cev+=2**st.begin();
		st.erase(st.begin());
	}
	while((int)st1.size()>=k){
		int say=0;
		while(say<k-1){say++;st1.erase(st1.begin());}
		cev+=2*(l-*st1.begin());
		st1.erase(st1.begin());
	}
	//~ cout<<cev<<endl;
	lo mn=inf;
	auto it=st.end();
	if(it!=st.begin()){
		it--;
		int at=*it*2;
		it=st1.end();
		if(it!=st1.begin()){
			it--;
			at+=(l-*it)*2;
		}
		//~ cout<<at<<endl;
		mn=min(mn,cev+at);
	}
	it=st1.end();
	if(it!=st1.begin()){
		it--;
		int at=(l-*it)*2;
		it=st.end();
		if(it!=st.begin()){
			it--;
			at+=*it*2;
		}
		//~ cout<<at<<endl;
		mn=min(mn,cev+at);
	}
	mn=min(mn,cev+((int)st.size()+(int)st1.size()+k-1)/k*l);
	int tut=0;
	for(auto it1=st.begin();it1!=st.end();it1++){
		tut++;
		int tut1=0;
		for(auto it2=st1.begin();it2!=st1.end();it2++){
			tut1++;
			mn=min(mn,cev+*it1*2+(l-*it2)*2+((int)st.size()-tut+(int)st1.size()-tut1+k-1)/k*l);
		}
	}
    return mn;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 4 ms 256 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 4 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Incorrect 4 ms 256 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Incorrect 4 ms 256 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Incorrect 4 ms 256 KB Output isn't correct
10 Halted 0 ms 0 KB -