| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 303464 | Vimmer | 카니발 티켓 (IOI20_tickets) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include "tickets.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define N 1005
#define PB push_back
#define sz(x) int(x.size())
#define P 31
#define F first
#define M ll(1e9 + 7)
#define S second
#define all(x) x.begin(), x.end()
#define endl '\n'
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
//typedef tree<int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
ll mlt(ll a, ll b) {return (a * b) % M;}
ll sm(ll a, ll b) {return (a + b) % M;}
ll calc(vector <vector <int> > &x, ll md)
{
ll sum = 0;
for (int i = 0; i < sz(x); i++) sum += abs(md - x[i][0]);
return sum;
}
ll clc(vector <int> &x, ll md)
{
ll sum = 0;
for (int i = 0; i < sz(x); i++) sum += abs(md - x[i]);
return sum;
}
ll calcer(vector <vector <int> > &x, ll md)
{
ll ans = 0;
vector <int> xt; xt.clear();
for (int i = 0; i < sz(x); i++)
if (abs(md - x[i][0]) > abs(md - x[i].back())) xt.PB(x[i][0]);
else xt.PB(x[i].back());
sort(xt.begin(), xt.end());
ll l = 0, r = 1e9;
while (l < r)
{
ll mdl = (l + r) / 2;
ll mdr = mdl + 1;
if (clc(xt, mdl) > clc(xt, mdr)) l = mdr;
else r = mdl;
}
return clc(xt, l);
}
ll find_maximum(int k, vector<vector<int> > x)
{
int n = sz(x);
int m = sz(x[0]);
if (m == 1)
{
ll l = 0, r = 1e9;
while (l < r)
{
ll mdl = (l + r) / 2;
ll mdr = mdl + 1;
if (calc(x, mdl) < calc(x, mdr)) r = mdl;
else l = mdr;
}
ll ans = calc(x, l);
for (int i = 0; i < n; i++)
x[i][0] = 0;
allocate_tickets(x);
return ans;
}
else
{
ll ans = 0;
vector <vector <int> > r;
r.resize(n);
ll mn = 1e9, mx = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {mn = min(mn, h[i][j]); mx = max(mx, h[i][j]);}
for (int i = 0; i < n; i++)
{
r[i].resize(m);
for (int j = 0; j < m; j++) r[i][j] = -1;
}
ll l = mn, rt = mx;
while (l < rt)
{
ll mdl = (l + rt) / 2;
ll mdr = mdl + 1;
if (calcer(x, mdl) > calcer(x, mdr)) rt = mdl;
else l = mdr;
}
ans = calcer(x, l);
vector <int> xt; xt.clear();
for (int i = 0; i < sz(x); i++)
if (abs(l - x[i][0]) > abs(l - x[i].back())) r[i][0] = 0;
else r[i][sz(r[i]) - 1] = 0;
allocate_tickets(r);
return ans;
}
}
//int main()
//{
//// freopen("help.in", "r", stdin); freopen("help.out", "w", stdout);
//
// ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//
// cout << find_maximum(1, {{0}, {10}, {3}, {5}, {8}, {1}}) << endl;
//}