oj.uz

Submission #413933

# Submission time Handle Problem Language Result Execution time Memory
413933 2021-05-29T17:40:46 Z ignaciocanta Raisins (IOI09_raisins) C++14
100 / 100
 176 ms 23136 KB 
#include <bits/stdc++.h>

using namespace std;

//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
//template<class T> using Tree = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
 
using tint = long long;
using ld = long double;
 
#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)	
 
using pi = pair<int,int>;
using pl = pair<tint,tint>;
using vi = vector<int>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vvi = vector<vi>;
using vl = vector<tint>;
using vb = vector<bool>;
 
#define pb push_back
#define pf push_front
#define rsz resize
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sz(x) (int)(x).size()
#define ins insert
 
#define f first
#define s second
#define mp make_pair
 
#define DBG(x) cerr << #x << " = " << x << endl;
 
const int MOD = 1e9+7; 
const int mod = 998244353;
const int MX = 55;
const tint INF = 1e18; 
const int inf = 2e8;
const ld PI = acos(ld(-1)); 
const ld eps = 1e-5;
 
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
 
template<class T> void remDup(vector<T> &v){ 
    sort(all(v)); v.erase(unique(all(v)),end(v));
}
 
template<class T> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} 
template<class T> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
 
bool valid(int x, int y, int n, int m){
    return (0<=x && x<n && 0<=y && y<m);
}
 
int cdiv(int a, int b) { return a/b+((a^b)>0&&a%b); } //redondea p arriba
int fdiv(int a, int b) { return a/b-((a^b)<0&&a%b); } //redondea p abajo
 
void NACHO(string name = ""){
    ios_base::sync_with_stdio(0); cin.tie(0);
    if(sz(name)){
        freopen((name+".in").c_str(), "r", stdin);
        freopen((name+".out").c_str(), "w", stdout);
    }
}

int a[MX][MX];
int dp[MX][MX][MX][MX];
int S[MX][MX];

int sum(int a, int b, int c, int d){
	return S[c][d]-S[c][b-1]-S[a-1][d]+S[a-1][b-1];
}

int main(){
	NACHO();
	int n, m; cin >> n >> m;
	F0R(i, n) F0R(j, m) cin >> a[i][j];
	FOR(i, 1, n+1){
		FOR(j, 1, m+1){
			S[i][j] += S[i-1][j]+S[i][j-1]-S[i-1][j-1]+a[i-1][j-1];
		}
	}
	F0R(i, n+1) F0R(j, m+1) dp[i][j][i][j] = 0;
	ROF(i, 1, n+1){
		ROF(j, 1, m+1){
			FOR(k, i, n+1){
				FOR(l, j, m+1){
					int s = sum(i, j, k, l);
					if(k == i && l == j) continue;
					dp[i][j][k][l] = inf;
					FOR(cut, i, k){
						ckmin(dp[i][j][k][l], dp[i][j][cut][l]+dp[cut+1][j][k][l]+s);
					}
					FOR(cut, j, l){
						ckmin(dp[i][j][k][l], dp[i][j][k][cut]+dp[i][cut+1][k][l]+s);
					}
				}
			}
		}
	}
	cout << dp[1][1][n][m] << "\n";
}

Compilation message

raisins.cpp: In function 'void NACHO(std::string)':
raisins.cpp:73:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |         freopen((name+".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
raisins.cpp:74:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |         freopen((name+".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 2 ms 1100 KB Output is correct
8 Correct 5 ms 2892 KB Output is correct
9 Correct 6 ms 3908 KB Output is correct
10 Correct 8 ms 4684 KB Output is correct
11 Correct 7 ms 4044 KB Output is correct
12 Correct 17 ms 7920 KB Output is correct
13 Correct 25 ms 10008 KB Output is correct
14 Correct 9 ms 4928 KB Output is correct
15 Correct 34 ms 11216 KB Output is correct
16 Correct 5 ms 4044 KB Output is correct
17 Correct 15 ms 7928 KB Output is correct
18 Correct 95 ms 17612 KB Output is correct
19 Correct 135 ms 21464 KB Output is correct
20 Correct 176 ms 23136 KB Output is correct