oj.uz

답안 #63143

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
63143 2018-07-31T22:59:24 Z qkxwsm Sure Bet (CEOI17_sure) C++17
100 / 100
 174 ms 21540 KB 
/*
PROG: source
LANG: C++11
    _____
  .'     '.
 /  0   0  \
|     ^     |
|  \     /  |
 \  '---'  /
  '._____.'
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

struct chash
{
        int operator()(int x) const
        {
                x ^= (x >> 20) ^ (x >> 12);
                return x ^ (x >> 7) ^ (x >> 4);
        }
        int operator()(long long x) const
        {
                return x ^ (x >> 32);
        }
};

template<typename T> using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using hashtable = gp_hash_table<T, U, chash>;

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
        {
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
template<class T, class U>
T normalize(T x, U mod = 1000000007)
{
	return (((x % mod) + mod) % mod);
}
long long randomizell(long long mod)
{
	return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
int randomize(int mod)
{
	return ((1ll << 15) * rand() + rand()) % mod;
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 100013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;

int N;
ld arr[2][MAXN];
ld pref[2][MAXN];
ld ans;

int32_t main()
{
	ios_base::sync_with_stdio(0);
	srand(time(0));
	cout << fixed << setprecision(4);
	//	cerr << fixed << setprecision(10);
	if (fopen("input.in", "r"))
	{
		freopen ("input.in", "r", stdin);
		freopen ("output.out", "w", stdout);
	}
        cin >> N;
        for (int i = 0; i < N; i++)
        {
                ld a, b;
                cin >> a >> b;
                a--; b--;
                arr[0][i] = a;
                arr[1][i] = b;
        }
        sort(arr[0], arr[0] + N);
        reverse(arr[0], arr[0] + N);
        sort(arr[1], arr[1] + N);
        reverse(arr[1], arr[1] + N);
        for (int i = 0; i < N; i++)
        {
                pref[0][i + 1] = pref[0][i] + arr[0][i];
                pref[1][i + 1] = pref[1][i] + arr[1][i];
                // cerr << pref[0][i + 1] << ' ' << pref[1][i + 1] << endl;
        }
        int iter = 0;
        for (int i = 0; i <= N; i++)
        {
                //suppose you take i
                pdd gain = {pref[0][i] - iter, pref[1][iter] - i};
                while(iter <= N)
                {
                        // cerr << i << ' ' << iter << ' ' << min(gain.fi, gain.se) << endl;
                        pdd poss = {pref[0][i] - (iter + 1), pref[1][iter + 1] - i};
                        if (min(poss.fi, poss.se) >= min(gain.fi, gain.se))
                        {
                                gain = poss;
                                iter++;
                        }
                        else
                        {
                                break;
                        }
                }
                ckmax(ans, min(gain.fi, gain.se));
        }
        ans += EPS;
        cout << ans << '\n';
	//	cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}

Compilation message

sure.cpp: In function 'int32_t main()':
sure.cpp:156:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("input.in", "r", stdin);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sure.cpp:157:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("output.out", "w", stdout);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 428 KB Output is correct
3 Correct 3 ms 508 KB Output is correct
4 Correct 4 ms 628 KB Output is correct
5 Correct 2 ms 628 KB Output is correct
6 Correct 3 ms 628 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 428 KB Output is correct
3 Correct 3 ms 508 KB Output is correct
4 Correct 4 ms 628 KB Output is correct
5 Correct 2 ms 628 KB Output is correct
6 Correct 3 ms 628 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 3 ms 636 KB Output is correct
9 Correct 3 ms 644 KB Output is correct
10 Correct 3 ms 692 KB Output is correct
11 Correct 2 ms 696 KB Output is correct
12 Correct 5 ms 704 KB Output is correct
13 Correct 5 ms 848 KB Output is correct
14 Correct 6 ms 880 KB Output is correct
15 Correct 5 ms 880 KB Output is correct
16 Correct 4 ms 880 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 428 KB Output is correct
3 Correct 3 ms 508 KB Output is correct
4 Correct 4 ms 628 KB Output is correct
5 Correct 2 ms 628 KB Output is correct
6 Correct 3 ms 628 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 3 ms 636 KB Output is correct
9 Correct 3 ms 644 KB Output is correct
10 Correct 3 ms 692 KB Output is correct
11 Correct 2 ms 696 KB Output is correct
12 Correct 5 ms 704 KB Output is correct
13 Correct 5 ms 848 KB Output is correct
14 Correct 6 ms 880 KB Output is correct
15 Correct 5 ms 880 KB Output is correct
16 Correct 4 ms 880 KB Output is correct
17 Correct 154 ms 8460 KB Output is correct
18 Correct 138 ms 9868 KB Output is correct
19 Correct 137 ms 11176 KB Output is correct
20 Correct 127 ms 12620 KB Output is correct
21 Correct 152 ms 14288 KB Output is correct
22 Correct 120 ms 15652 KB Output is correct
23 Correct 130 ms 17012 KB Output is correct
24 Correct 124 ms 18412 KB Output is correct
25 Correct 174 ms 19900 KB Output is correct
26 Correct 141 ms 21540 KB Output is correct