oj.uz

Submission #761729

# Submission time Handle Problem Language Result Execution time Memory
761729 2023-06-20T08:13:42 Z Dan4Life Aliens (IOI16_aliens) C++17
12 / 100
 77 ms 2260 KB 
#include "aliens.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
using ll = long long;
using ar = array<int,2>;

ll take_photos(int n, int m, int k, vector<int> r, vector<int> c) {
	for(int i = 0; i < n; i++)
		if(r[i]>c[i]) r[i]=m-r[i]-1,c[i]=m-c[i]-1;
	vector<ar> v,w; int mn=m;
	for(int i = 0; i < n; i++) w.pb({c[i],r[i]});
	sort(begin(w),end(w),[&](ar a, ar b){
		if(a[0]!=b[0]) return a[0]<b[0];
		return a[1]>b[1];
	}); 
	for(int i = n-1; i >=0; i--){
		if(mn>w[i][1]) v.pb(w[i]);
		mn = min(mn,w[i][1]);
	}
	n = sz(v); ll dp[k+1][n+1], ans = (ll)4e18;
	memset(dp,63,sizeof(dp)); sort(begin(v),end(v));
	for(int i = 1; i <= n; i++){
		dp[1][i]=v[i-1][0]-v[0][1]+1;
		dp[1][i]*=dp[1][i];
	}
	for(int j = 2; j <= k; j++)
		for(int i = 1; i <= n; i++)
			for(int x = 1; x < i; x++)
				dp[j][i] = min(dp[j][i], dp[j-1][x]+
					(v[i-1][0]-v[x][1]+1)*(v[i-1][0]-v[x][1]+1));	
	for(int i = 1; i <= k; i++) ans = min(ans, dp[i][n]);
    return ans;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Correct answer: answer = 4
2 Correct 0 ms 212 KB Correct answer: answer = 4
3 Correct 1 ms 212 KB Correct answer: answer = 4
4 Incorrect 1 ms 212 KB Wrong answer: output = 13, expected = 12
5 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Correct answer: answer = 1
2 Correct 0 ms 212 KB Correct answer: answer = 4
3 Correct 1 ms 212 KB Correct answer: answer = 1
4 Correct 1 ms 212 KB Correct answer: answer = 5
5 Correct 1 ms 212 KB Correct answer: answer = 41
6 Correct 1 ms 212 KB Correct answer: answer = 71923
7 Correct 1 ms 300 KB Correct answer: answer = 77137
8 Correct 24 ms 980 KB Correct answer: answer = 764
9 Correct 1 ms 212 KB Correct answer: answer = 250000
10 Correct 77 ms 2260 KB Correct answer: answer = 500
11 Correct 1 ms 212 KB Correct answer: answer = 32
12 Correct 1 ms 300 KB Correct answer: answer = 130050
13 Correct 9 ms 428 KB Correct answer: answer = 5110
14 Correct 2 ms 340 KB Correct answer: answer = 2626
15 Correct 4 ms 468 KB Correct answer: answer = 796
16 Correct 6 ms 428 KB Correct answer: answer = 7580
17 Correct 23 ms 848 KB Correct answer: answer = 1904
18 Correct 1 ms 212 KB Correct answer: answer = 996004
19 Correct 2 ms 340 KB Correct answer: answer = 38817
20 Correct 10 ms 596 KB Correct answer: answer = 4096
21 Correct 1 ms 212 KB Correct answer: answer = 1
22 Correct 1 ms 212 KB Correct answer: answer = 1
23 Correct 21 ms 724 KB Correct answer: answer = 2040
24 Correct 1 ms 296 KB Correct answer: answer = 2

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Correct answer: answer = 4
2 Correct 0 ms 212 KB Correct answer: answer = 4
3 Correct 1 ms 212 KB Correct answer: answer = 4
4 Incorrect 1 ms 212 KB Wrong answer: output = 13, expected = 12
5 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Correct answer: answer = 4
2 Correct 0 ms 212 KB Correct answer: answer = 4
3 Correct 1 ms 212 KB Correct answer: answer = 4
4 Incorrect 1 ms 212 KB Wrong answer: output = 13, expected = 12
5 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Correct answer: answer = 4
2 Correct 0 ms 212 KB Correct answer: answer = 4
3 Correct 1 ms 212 KB Correct answer: answer = 4
4 Incorrect 1 ms 212 KB Wrong answer: output = 13, expected = 12
5 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Correct answer: answer = 4
2 Correct 0 ms 212 KB Correct answer: answer = 4
3 Correct 1 ms 212 KB Correct answer: answer = 4
4 Incorrect 1 ms 212 KB Wrong answer: output = 13, expected = 12
5 Halted 0 ms 0 KB -