oj.uz

답안 #832467

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
832467 2023-08-21T10:42:11 Z AkramElOmrani 말 (IOI15_horses) C++17
0 / 100
 12 ms 8276 KB 
#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__);


void max_self(int& a, int b) {
	a = max(a, b);
}

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);
		for(int h = 0; h < nax; ++h) {
			if(!vis[h]) continue;
			int disp = h * x[i];
			if(disp >= nax) continue;
			for(int sell = 0; sell <= disp; ++sell) {
				// cerr << (h - sell) * x[i] << "\n";
				max_self(new_dp[(disp - sell) * x[i]], dp[h] + sell * y[i]);
				new_vis[(disp - sell) * x[i]] = 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;
}

Compilation message

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

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 12 ms 8276 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -