oj.uz

답안 #151633

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
151633 2019-09-04T00:37:21 Z shdut 십자가 놓기 (FXCUP4_cross) C++17
100 / 100
 376 ms 18404 KB 
#include "cross.h"
#include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <algorithm>
#include <assert.h>

using namespace std;

#define rep(i, a, b) for(int i = a; i < b; i++)
#define per(i, a, b) for(int i = b - 1; i >= a; i--)
#define ll long long
#define x first
#define y second
#define vi vector<int>
#define pii pair<int, int>
#define SZ(x) (int)(x.size())
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define mod 1000000007
#define inf 1000000007
#define DBG(x) cerr << (#x) << "=" << x << "\n";

#define N 100005

template<typename U, typename V> void Min(U &a, const V &b){if(a > b) a = b;}
template<typename U, typename V> void Max(U &a, const V &b){if(a < b) a = b;}
template<typename U, typename V> void add(U &a, const V &b){a = (a+b) % mod;}


ll sqr(int x){if(x <= 0)return 0; return 1LL * x * x;}
long long SelectCross(int K, std::vector<int> I, std::vector<int> O) {
	int n = I.size();
	vector<pii> a(n);
	rep(i, 0, n)a[i] = {I[i], O[i]};
	sort(all(a));
	ll ans = 0;
	multiset<int>s;
	s.insert(inf);
	per(i, 0, n){
		if(s.size() == K){
			int x = min(*s.begin(), a[i].y);
			Max(ans, 1LL * a[i].x * a[i].x + 2LL * a[i].x * (x - a[i].x));
		}
		s.insert(a[i].y);
		if(s.size() > K)s.erase(s.begin());
	}
	s.clear();
	rep(i, 0, n)swap(a[i].x, a[i].y);
	sort(all(a));
	s.insert(inf);
	per(i, 0, n){
		if(s.size() == K){
			int x = min(*s.begin(), a[i].y);
			Max(ans, sqr(a[i].x) - sqr(a[i].x - x));
		}
		s.insert(a[i].y);
		if(s.size() > K)s.erase(s.begin());
	}
	return ans;
}

Compilation message

cross.cpp: In function 'long long int SelectCross(int, std::vector<int>, std::vector<int>)':
cross.cpp:47:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(s.size() == K){
      ~~~~~~~~~^~~~
cross.cpp:52:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(s.size() > K)s.erase(s.begin());
      ~~~~~~~~~^~~
cross.cpp:59:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(s.size() == K){
      ~~~~~~~~~^~~~
cross.cpp:64:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(s.size() > K)s.erase(s.begin());
      ~~~~~~~~~^~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 10 ms 888 KB Output is correct
6 Correct 136 ms 9040 KB Output is correct
7 Correct 136 ms 8924 KB Output is correct
8 Correct 136 ms 8972 KB Output is correct

Subtask #2
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 10 ms 888 KB Output is correct
6 Correct 136 ms 9040 KB Output is correct
7 Correct 136 ms 8924 KB Output is correct
8 Correct 136 ms 8972 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 10 ms 888 KB Output is correct
13 Correct 70 ms 4972 KB Output is correct
14 Correct 137 ms 8932 KB Output is correct
15 Correct 137 ms 9068 KB Output is correct
16 Correct 137 ms 8936 KB Output is correct

Subtask #3
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 10 ms 888 KB Output is correct
6 Correct 136 ms 9040 KB Output is correct
7 Correct 136 ms 8924 KB Output is correct
8 Correct 136 ms 8972 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 10 ms 888 KB Output is correct
13 Correct 70 ms 4972 KB Output is correct
14 Correct 137 ms 8932 KB Output is correct
15 Correct 137 ms 9068 KB Output is correct
16 Correct 137 ms 8936 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 16 ms 1528 KB Output is correct
20 Correct 83 ms 5180 KB Output is correct
21 Correct 109 ms 7340 KB Output is correct
22 Correct 139 ms 9064 KB Output is correct
23 Correct 143 ms 9116 KB Output is correct
24 Correct 183 ms 10352 KB Output is correct
25 Correct 321 ms 15000 KB Output is correct
26 Correct 376 ms 18404 KB Output is correct