oj.uz

답안 #148928

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
148928 2019-09-01T05:24:39 Z 서울대학교 연구공원 944동 삼성전자서울대연구소(#3600, ho94949, dotorya, zigui) 십자가 놓기 (FXCUP4_cross) C++17
0 / 100
 6 ms 384 KB 
#include "cross.h"

#include <stdio.h>  
#include <algorithm>  
#include <assert.h>
#include <bitset>
#include <cmath>  
#include <complex>  
#include <deque>  
#include <functional>  
#include <iostream>  
#include <limits.h>  
#include <map>  
#include <math.h>  
#include <queue>  
#include <set>  
#include <stdlib.h>  
#include <string.h>  
#include <string>  
#include <time.h>  
#include <unordered_map>  
#include <unordered_set>  
#include <vector>  

#pragma warning(disable:4996)  
#pragma comment(linker, "/STACK:336777216")  
using namespace std;

#define mp make_pair  
#define Fi first  
#define Se second  
#define pb(x) push_back(x)  
#define szz(x) ((int)(x).size())  
#define rep(i, n) for(int i=0;i<n;i++)  
#define all(x) (x).begin(), (x).end()  
#define ldb ldouble  

typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;

int IT_MAX = 1 << 19;
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1e-10;

pll in[300050];

ll getarea(ll a, ll b) {
	if (b >= a) return a * a;
	return a * a - (a - b)*(a - b);
}
priority_queue <ll, vector<ll>, greater<ll>> Hx;
long long SelectCross(int K, std::vector<int> I, std::vector<int> O) {
	int N = I.size();
	for (int i = 0; i < N; i++) in[i] = pll(O[i], I[i]);

	sort(in + 1, in + N + 1);
	for (int i = N - 1; i >= N - K; i--) Hx.push(in[i].second);

	ll rv = 0;
	rv = getarea(in[N-K].first, Hx.top());
	for (int i = N - K - 1; i >= 0; i--) {
		Hx.push(in[i].second);
		Hx.pop();
		rv = max(rv, getarea(in[N - K].first, Hx.top()));
	}
	return rv;
}

Compilation message

cross.cpp:25:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning(disable:4996)  
 
cross.cpp:26:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/STACK:336777216")

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Incorrect 6 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Incorrect 6 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Incorrect 6 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -