제출 #333798

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
333798		LucaDantas	Hiring (IOI09_hiring)	C++17	0 / 100	313 ms	25196 KiB

hiring

#include<bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int,int>;

#define ff first
#define ss second

constexpr int maxn = 5e5+10, logn = 20;

struct Fraction
{
	int p, q, id;
	Fraction() {}
	Fraction(int a, int b, int c) : p(a), q(b), id(c) {}
	bool operator<(Fraction b) { return 1ll*p*b.q < 1ll*q*b.p; }
	ll operator*(ll a) {return (1ll * a * q) / p;}
} val[maxn];

struct BIT
{
	ll bit[maxn];
	void upd(int x, int v) {
		for(; x < maxn; x += x&-x)
			bit[x] += v;
	}
	ll query(int x) {
		ll ans = 0;
		for(; x > 0; x -= x&-x)
			ans += bit[x];
		return ans;
	}
	int bs(ll& val) {
		int pos = 0;
		for(int l = logn; l >= 0; l--) {
			if(pos + (1 << l) >= 10) continue;
			if(bit[pos + (1 << l)] <= val)
				pos += (1 << l), val -= bit[pos];
		}
		return pos;
	}
} bit, ligados;

int pos[maxn];
pii opa[maxn];

int main() {
	int n; ll w; scanf("%d %lld", &n, &w);
	for(int i = 0, a, b; i < n; i++)
		scanf("%d %d", &a, &b), val[i] = Fraction(a, b, i), opa[i] = {b, i};
	sort(opa, opa+n);
	for(int i = 0; i < n; i++)
		pos[opa[i].ss] = i+1;
	sort(val, val+n);

	ll ans = 0, sobra = 0;
	for(int i = 0; i < n; i++) {
		bit.upd(pos[val[i].id], val[i].q);
		ligados.upd(pos[val[i].id], 1);

		ll pay = val[i] * w;
		
		int p = bit.bs(pay);
		int here = ligados.query(p);
		
		if(here == ans)
			sobra = max(sobra, (pay*val[i].p)/val[i].q);
		else if(here > ans) ans = here, sobra = (pay*val[i].p)/val[i].q;
	}
	printf("%lld\n", ans);
	puts("TESTANDO SE A RESPOSTA TÁ CERTA DPS RECUPERO QUAL FOI");
}

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

hiring.cpp: In function 'int main()':
hiring.cpp:49:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   49 |  int n; ll w; scanf("%d %lld", &n, &w);
      |               ~~~~~^~~~~~~~~~~~~~~~~~~
hiring.cpp:51:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   51 |   scanf("%d %d", &a, &b), val[i] = Fraction(a, b, i), opa[i] = {b, i};
      |   ~~~~~^~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 30
• Subtask 2: 0 / 28
• Subtask 3: 0 / 6
• Subtask 4: 0 / 6
• Subtask 5: 0 / 6
• Subtask 6: 0 / 6
• Subtask 7: 0 / 6
• Subtask 8: 0 / 6
• Subtask 9: 0 / 6