oj.uz

Submission #708266

# Submission time Handle Problem Language Result Execution time Memory
708266 2023-03-11T13:32:20 Z Alihan_8 Horses (IOI15_horses) C++17
17 / 100
 271 ms 524288 KB 
#include <bits/stdc++.h>
#include "horses.h"
#define Flag false
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define int long long
typedef long long ll;
const ll Mod = 1e9+7;
vector <int> x, y;
bool chmax(int &x, int y){
    bool flag = false;
    if ( x < y ){
        x = y; flag |= true;
    }
    return flag;
}
int F(){
    int n = (int)x.size();
    const int N = 1e3+1, inf = 1e9;
    vector <vector<int>> dp(n+1, vector <int> (N, -inf));
    dp[0][1] = 0;
    for ( int i = 0; i < n; i++ ){
        for ( int j = 0; j < N; j++ ){
            chmax(dp[i+1][j], dp[i][j]);
            if ( j*x[i] >= N ) continue;
            for ( int k = 0; k <= j*x[i]; k++ ){
                chmax(dp[i+1][j*x[i]-k], k*y[i]+dp[i][j]);
            }
        }
    }
    return dp[n][0];
}
int init(int N, int X[], int Y[]) {
	int n = N;
	x.resize(n), y.resize(n);
	for ( int i = 0; i < n; i++ ){
        x[i] = X[i], y[i] = Y[i];
	}
    return F();
}
int updateX(int pos, int val){
    x[pos] = val;
	return F();
}
int updateY(int pos, int val){
    y[pos] = val;
	return F();
}
#if Flag
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n; cin >> n;
    int X[n], Y[n];
    for ( int i = 0; i < n; i++ ) cin >> X[i];
    for ( int i = 0; i < n; i++ ) cin >> Y[i];
    cout << init(n, X, Y) << ln;
    int q; cin >> q;
    while ( q-- ){
        int type, l, r; cin >> type >> l >> r;
        if ( type == 1 ) cout << updateX(l, r) << ln;
        else cout << updateY(l, r) << ln;
    }

    cout << '\n';
/*
3
2 1 3
3 4 1
1
2 1 2
answer: {8, 6}
*/
}
#endif

Compilation message

horses.cpp: In function 'bool chmax(int&, int)':
horses.cpp:18:24: warning: declaration of 'y' shadows a global declaration [-Wshadow]
   18 | bool chmax(int &x, int y){
      |                    ~~~~^
horses.cpp:17:17: note: shadowed declaration is here
   17 | vector <int> x, y;
      |                 ^
horses.cpp:18:17: warning: declaration of 'x' shadows a global declaration [-Wshadow]
   18 | bool chmax(int &x, int y){
      |            ~~~~~^
horses.cpp:17:14: note: shadowed declaration is here
   17 | vector <int> x, y;
      |              ^
horses.cpp: In function 'void IO(std::string)':
horses.cpp:13:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
horses.cpp:13:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 9 ms 340 KB Output is correct
3 Correct 6 ms 296 KB Output is correct
4 Correct 5 ms 296 KB Output is correct
5 Correct 23 ms 304 KB Output is correct
6 Correct 7 ms 348 KB Output is correct
7 Correct 16 ms 348 KB Output is correct
8 Correct 5 ms 348 KB Output is correct
9 Correct 7 ms 340 KB Output is correct
10 Correct 12 ms 348 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 3 ms 212 KB Output is correct
13 Correct 4 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 3 ms 212 KB Output is correct
16 Correct 14 ms 340 KB Output is correct
17 Correct 6 ms 212 KB Output is correct
18 Correct 4 ms 212 KB Output is correct
19 Correct 5 ms 212 KB Output is correct
20 Correct 11 ms 468 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 9 ms 340 KB Output is correct
3 Correct 7 ms 352 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 25 ms 340 KB Output is correct
6 Correct 8 ms 340 KB Output is correct
7 Correct 18 ms 340 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 7 ms 300 KB Output is correct
10 Correct 15 ms 340 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 3 ms 212 KB Output is correct
13 Correct 4 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 3 ms 212 KB Output is correct
16 Correct 13 ms 352 KB Output is correct
17 Correct 6 ms 300 KB Output is correct
18 Correct 4 ms 212 KB Output is correct
19 Correct 5 ms 304 KB Output is correct
20 Correct 11 ms 300 KB Output is correct
21 Incorrect 25 ms 348 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 271 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 9 ms 340 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 7 ms 340 KB Output is correct
5 Correct 23 ms 340 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 9 ms 340 KB Output is correct
8 Correct 6 ms 304 KB Output is correct
9 Correct 7 ms 340 KB Output is correct
10 Correct 13 ms 224 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 3 ms 316 KB Output is correct
13 Correct 4 ms 300 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 4 ms 296 KB Output is correct
16 Correct 14 ms 304 KB Output is correct
17 Correct 5 ms 212 KB Output is correct
18 Correct 4 ms 300 KB Output is correct
19 Correct 5 ms 336 KB Output is correct
20 Correct 10 ms 348 KB Output is correct
21 Incorrect 26 ms 340 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 300 KB Output is correct
2 Correct 10 ms 340 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 6 ms 300 KB Output is correct
5 Correct 15 ms 296 KB Output is correct
6 Correct 8 ms 348 KB Output is correct
7 Correct 17 ms 352 KB Output is correct
8 Correct 5 ms 300 KB Output is correct
9 Correct 7 ms 340 KB Output is correct
10 Correct 16 ms 340 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 4 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 8 ms 296 KB Output is correct
17 Correct 6 ms 212 KB Output is correct
18 Correct 4 ms 328 KB Output is correct
19 Correct 5 ms 212 KB Output is correct
20 Correct 11 ms 340 KB Output is correct
21 Incorrect 24 ms 340 KB Output isn't correct
22 Halted 0 ms 0 KB -