oj.uz

Submission #379983

# Submission time Handle Problem Language Result Execution time Memory
379983 2021-03-19T21:29:33 Z AmineWeslati Aliens (IOI16_aliens) C++14
0 / 100
 2000 ms 489964 KB 
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////

#ifndef LOCAL
#include "aliens.h"
#endif

const int MX=500;
int N,M,K;
V<ll> f(MX,0);

int maxo[MX][MX];

ll maxi(int l, int r){
	/*ll ans=0;
	FOR(i,l,r+1) ckmax(ans,f[i]);
	return ans;*/
	return maxo[l][r];
}

ll collision(ll i, ll j, ll mxx){
	ckmin(mxx,j);
	if(i>mxx) return 0;
	return (mxx-i+1)*(mxx-i+1);
}

int memo[MX][MX][MX];

ll solve(int i, int p, int n){
	if(n>K) return INF;
	if(i==M+1) return 0;
 	
 	ll ind=memo[i][p][n]; 
 	if(ind!=-1) return ind;

 	int mx=maxi(1,i-1);
 	ll ans=INF;
 	
 	if(f[i]==0)
 		ans=solve(i+1,p,n);
 	else{
 		//new pic 
	 	ll v=f[i]-i+1; v*=v;
	 	v-=collision(i,f[i],mx);
	 	ckmin(ans,solve(i+1,i,n+1)+v);

	 	//attach
	 	if(p!=0){
	 		v=f[i]-p+1; v*=v;
	 		v-=(mx-p+1)*(mx-p+1);
	 		ckmax(v,0ll);
	 		ckmin(ans,solve(i+1,p,n)+v);
	 	}

 	}

 	
	
 	return ind=ans;
}

ll take_photos(int n, int m, int k, vi r, vi c) {
	tie(N,M,K)={n,m,k};
	FOR(i,0,N){
		r[i]++; 
		c[i]++;
		ckmax(f[min(r[i],c[i])],(ll)max(r[i],c[i]));
	}

	//FOR(i,1,N+1) cout << f[i] << ' '; cout << endl;

	FOR(i,0,M+1) FOR(j,i,M+1){
		maxo[i][j]=f[j];
		if(j>i) ckmax(maxo[i][j],maxo[i][j-1]);
	}

	memset(memo,-1,sizeof(memo));
	return solve(1,0,0);
}


#ifdef LOCAL
int main() {
    boost; IO();

    int N,M,K; cin>>N>>M>>K;
    vi x(N),y(N);
    FOR(i,0,N) cin>>x[i]>>y[i];
    cout << take_photos(N,M,K,x,y) << endl;

    return 0;
}
#endif
//Change your approach 

/*
5 7 2
0 4 4 4 4
3 4 6 5 6
*/

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 274 ms 489652 KB Correct answer: answer = 4
2 Correct 265 ms 489580 KB Correct answer: answer = 4
3 Correct 280 ms 489580 KB Correct answer: answer = 4
4 Correct 269 ms 489836 KB Correct answer: answer = 12
5 Correct 267 ms 489580 KB Correct answer: answer = 52
6 Correct 271 ms 489836 KB Correct answer: answer = 210
7 Correct 271 ms 489580 KB Correct answer: answer = 88
8 Correct 267 ms 489708 KB Correct answer: answer = 7696
9 Correct 295 ms 489580 KB Correct answer: answer = 1
10 Correct 1548 ms 489752 KB Correct answer: answer = 2374
11 Execution timed out 2109 ms 489964 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 489580 KB Correct answer: answer = 1
2 Correct 269 ms 489580 KB Correct answer: answer = 4
3 Correct 269 ms 489580 KB Correct answer: answer = 1
4 Correct 267 ms 489708 KB Correct answer: answer = 5
5 Correct 269 ms 489716 KB Correct answer: answer = 41
6 Runtime error 29 ms 2668 KB Execution killed with signal 11
7 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 274 ms 489652 KB Correct answer: answer = 4
2 Correct 265 ms 489580 KB Correct answer: answer = 4
3 Correct 280 ms 489580 KB Correct answer: answer = 4
4 Correct 269 ms 489836 KB Correct answer: answer = 12
5 Correct 267 ms 489580 KB Correct answer: answer = 52
6 Correct 271 ms 489836 KB Correct answer: answer = 210
7 Correct 271 ms 489580 KB Correct answer: answer = 88
8 Correct 267 ms 489708 KB Correct answer: answer = 7696
9 Correct 295 ms 489580 KB Correct answer: answer = 1
10 Correct 1548 ms 489752 KB Correct answer: answer = 2374
11 Execution timed out 2109 ms 489964 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 274 ms 489652 KB Correct answer: answer = 4
2 Correct 265 ms 489580 KB Correct answer: answer = 4
3 Correct 280 ms 489580 KB Correct answer: answer = 4
4 Correct 269 ms 489836 KB Correct answer: answer = 12
5 Correct 267 ms 489580 KB Correct answer: answer = 52
6 Correct 271 ms 489836 KB Correct answer: answer = 210
7 Correct 271 ms 489580 KB Correct answer: answer = 88
8 Correct 267 ms 489708 KB Correct answer: answer = 7696
9 Correct 295 ms 489580 KB Correct answer: answer = 1
10 Correct 1548 ms 489752 KB Correct answer: answer = 2374
11 Execution timed out 2109 ms 489964 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 274 ms 489652 KB Correct answer: answer = 4
2 Correct 265 ms 489580 KB Correct answer: answer = 4
3 Correct 280 ms 489580 KB Correct answer: answer = 4
4 Correct 269 ms 489836 KB Correct answer: answer = 12
5 Correct 267 ms 489580 KB Correct answer: answer = 52
6 Correct 271 ms 489836 KB Correct answer: answer = 210
7 Correct 271 ms 489580 KB Correct answer: answer = 88
8 Correct 267 ms 489708 KB Correct answer: answer = 7696
9 Correct 295 ms 489580 KB Correct answer: answer = 1
10 Correct 1548 ms 489752 KB Correct answer: answer = 2374
11 Execution timed out 2109 ms 489964 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 274 ms 489652 KB Correct answer: answer = 4
2 Correct 265 ms 489580 KB Correct answer: answer = 4
3 Correct 280 ms 489580 KB Correct answer: answer = 4
4 Correct 269 ms 489836 KB Correct answer: answer = 12
5 Correct 267 ms 489580 KB Correct answer: answer = 52
6 Correct 271 ms 489836 KB Correct answer: answer = 210
7 Correct 271 ms 489580 KB Correct answer: answer = 88
8 Correct 267 ms 489708 KB Correct answer: answer = 7696
9 Correct 295 ms 489580 KB Correct answer: answer = 1
10 Correct 1548 ms 489752 KB Correct answer: answer = 2374
11 Execution timed out 2109 ms 489964 KB Time limit exceeded
12 Halted 0 ms 0 KB -