제출 #391089

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
391089		arwaeystoamneg	쌀 창고 (IOI11_ricehub)	C++17	0 / 100	20 ms	2096 KiB

ricehub

// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
}
#include "ricehub.h"
const int MAX = 100005;
int n, a[MAX], m;
ll b;
ll solve(int c)
{
	ll cur = 0, ans = linf;
	F0R(i, c)cur += abs(a[i] - a[c / 2]);
	ans = cur;
	F0R(i, n - c)
	{
		cur -= abs(a[i] - a[i + c / 2]);
		cur += abs(a[i + c] - a[i + c / 2]);
		if (c & 1)cur -= abs(a[i + 1] - a[i]);
		ans = min(ans, cur);
	}
	return ans;
}
int besthub(int R, int L, int X[], long long B)
{
	n = R;
	m = L;
	F0R(i, n)a[i] = X[i];
	b = B;
	int l = 1, r = n;
	while (l < r)
	{
		int mid = (l + r + 1) / 2;
		if (solve(mid) <= B)
			l = mid;
		else
			r = mid - 1;
	}
	return l;
}
#ifdef arwaeystoamneg
#define MAX_R  1000000

static int R, L;
static long long B;
static int X[MAX_R];
static int solution;

inline
void my_assert(int e) { if (!e) abort(); }

static void read_input()
{
	int i;
	my_assert(3 == scanf("%d %d %lld", &R, &L, &B));
	for (i = 0; i < R; i++)
		my_assert(1 == scanf("%d", &X[i]));
	my_assert(1 == scanf("%d", &solution));
}

int main()
{
	setIO("test1");
	int ans;
	read_input();
	ans = besthub(R, L, X, B);
	if (ans == solution)
		printf("Correct.\n");
	else
		printf("Incorrect.  Returned %d instead of %d.\n", ans, solution);

	return 0;
}
#endif

컴파일 시 표준 에러 (stderr) 메시지

ricehub.cpp: In function 'void setIO(std::string)':
ricehub.cpp:48:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   48 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ricehub.cpp:50:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   50 |    freopen((s + ".out").c_str(), "w", stdout);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 17
• Subtask 2: 0 / 25
• Subtask 3: 0 / 26
• Subtask 4: 0 / 32