제출 #832483

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
832483		AkramElOmrani	말 (IOI15_horses)	C++17	17 / 100	13 ms	8312 KiB

horses

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

#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,bmi,bmi2,popcnt,lzcnt")

#define ll long long

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
 
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__);

const int mod = 1e9 + 7;
void max_self(int& a, int b) {
	a = max(a, b);
}

int add(int a, int b) {
	a += b;
	if(a > mod) {
		a -= mod;
	}
	return a;
}
int mul(int a, int b) {
	a = (ll)(a * b) % mod;
	return a;
}

int init(int n, int x[], int y[]) {
	const int nax = 1003;
	vector<int> dp(nax), new_dp(nax);
	vector<bool> vis(nax), new_vis(nax);
	vis[1] = 1;
	dp[1] = 0; // max score so far 
	for(int i = 0; i < n; ++i) {
		// dbg(x[i], y[i])
		// either sell some number of horses and multiply the rest
		new_vis = vector<bool>(nax);
		new_dp = vector<int>(nax);
		for(int h = 0; h < nax; ++h) {
			if(!vis[h]) continue;
			int disp = h * x[i];
			assert(disp < nax);
			for(int sell = 0; sell <= disp; ++sell) {
				// cerr << (h - sell) * x[i] << "\n";
				max_self(new_dp[(disp - sell)], add(dp[h], mul(sell, y[i])));
				new_vis[(disp - sell)] = 1;
			}
		}
		swap(dp, new_dp);
		swap(vis, new_vis);
	}
	int ans = 0;
	for(int i = 0; i < nax; ++i) {
		max_self(ans, dp[i]);
	}
	return ans;
}
int updateX(int pos, int val) {
	return 0;
}
int updateY(int pos, int val) {
	return 0;
}





























// static char buffer[1024];
// static int currentChar = 0;
// static int charsNumber = 0;

// static inline int read() {
//   if (charsNumber < 0) {
// 	exit(1);
//   }
//   if (!charsNumber || currentChar == charsNumber) {
// 	charsNumber = (int)fread(buffer, sizeof(buffer[0]), sizeof(buffer), stdin);
// 	currentChar = 0;
//   }
//   if (charsNumber <= 0) {
// 	return -1;
//   }
//   return buffer[currentChar++];
// }

// static inline int readInt() {
//   int x; cin >> x;
//   return x;
// }

// int main() {
//   int N;
//   N = readInt();

//   int *X = (int *)malloc(sizeof(int) * (unsigned int)N);
//   int *Y = (int *)malloc(sizeof(int) * (unsigned int)N);

//   for (int i = 0; i < N; i++) {
// 	X[i] = readInt();
//   }

//   for (int i = 0; i < N; i++) {
// 	Y[i] = readInt();
//   }

//   printf("%d\n", init(N, X, Y));

//   int M;
//   M = readInt();

//   for (int i = 0; i < M; i++) {
// 	int type;
// 	type = readInt();
// 	int pos;
// 	pos = readInt();
// 	int val;
// 	val = readInt();

// 	if (type == 1) {
// 	  printf("%d\n", updateX(pos, val));
// 	} else if (type == 2) {
// 	  printf("%d\n", updateY(pos, val));
// 	}
//   }

//   return 0;
// }

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

horses.cpp: In function 'int updateX(int, int)':
horses.cpp:68:17: warning: unused parameter 'pos' [-Wunused-parameter]
   68 | int updateX(int pos, int val) {
      |             ~~~~^~~
horses.cpp:68:26: warning: unused parameter 'val' [-Wunused-parameter]
   68 | int updateX(int pos, int val) {
      |                      ~~~~^~~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:71:17: warning: unused parameter 'pos' [-Wunused-parameter]
   71 | int updateY(int pos, int val) {
      |             ~~~~^~~
horses.cpp:71:26: warning: unused parameter 'val' [-Wunused-parameter]
   71 | int updateY(int pos, int val) {
      |                      ~~~~^~~

• Subtask 1: 17 / 17
• Subtask 2: 0 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 23
• Subtask 5: 0 / 23