oj.uz

답안 #498360

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
498360 2021-12-25T05:05:36 Z Ierus Sure Bet (CEOI17_sure) C++17
20 / 100
 2000 ms 204 KB 
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("unroll-loops,Ofast,O3")
#pragma GCC target("avx,avx2,fma")
#define F first
#define S second
#define sz(x) (int)x.size()
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define NFS ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0) ;
typedef long long ll;
const int E = 1e6+777;
const long long inf = 1e18+777;
const int N = 1e5+777;
const int MOD = 1e9+7;
const bool I = 1;
int n, color[N];
double a[N], b[N];
double getslow(int len = 0, int cl = -1, double cnt = 0){
	if(len > 0){
		color[len] = cl;
		if(len == max(n, 10)){
			double sum1 = 0, sum2 = 0;
			for(int i = 1; i <= n; ++i){
				if(color[i] == 1) sum1 += a[i];
				else if(color[i] == 2) sum2 += b[i];
				else if(color[i] == 3) sum1 += a[i], sum2 += b[i];
			}
//			cerr << "color\n";
//			for(int i = 1; i <= n; ++i){
//				cerr << color[i] << '\n';
//			}cerr << '\n';
//			cerr << "res1: " << sum1 - cnt << " res2: " << sum2 - cnt << '\n';
			return (double)min(sum1 - cnt, sum2 - cnt);
		}
	}
	return max({getslow(len + 1, 0, cnt), getslow(len + 1, 1, cnt + 1), getslow(len + 1, 2, cnt + 1), getslow(len + 1, 3, cnt+2)});
}
int main(){
	cin >> n;
	for(int i = 1; i <= n; ++i){
		cin >> a[i] >> b[i];
	}
	cout << fixed << setprecision(4) << getslow();
};

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 204 KB Output is correct
2 Correct 5 ms 204 KB Output is correct
3 Correct 35 ms 204 KB Output is correct
4 Correct 36 ms 204 KB Output is correct
5 Correct 35 ms 204 KB Output is correct
6 Correct 35 ms 204 KB Output is correct

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 204 KB Output is correct
2 Correct 5 ms 204 KB Output is correct
3 Correct 35 ms 204 KB Output is correct
4 Correct 36 ms 204 KB Output is correct
5 Correct 35 ms 204 KB Output is correct
6 Correct 35 ms 204 KB Output is correct
7 Execution timed out 2075 ms 204 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 204 KB Output is correct
2 Correct 5 ms 204 KB Output is correct
3 Correct 35 ms 204 KB Output is correct
4 Correct 36 ms 204 KB Output is correct
5 Correct 35 ms 204 KB Output is correct
6 Correct 35 ms 204 KB Output is correct
7 Execution timed out 2075 ms 204 KB Time limit exceeded
8 Halted 0 ms 0 KB -