oj.uz

Submission #248901

# Submission time Handle Problem Language Result Execution time Memory
248901 2020-07-13T17:20:51 Z ryansee Wombats (IOI13_wombats) C++14
76 / 100
 20000 ms 106232 KB 
#include "wombats.h"

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

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=int; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

// #define LLINF ((long long)1e18)
#define INF int(1e9+1e6)
#define MAXN (300006)
ll n, M, H[5003][203], C[5003][203];
struct node {
	ll dp[203][203];
	node*l,*r;
	node(int s,int e){
		int m=(s+e)>>1;
		if(e-s>=15) l=new node(s,m),r=new node(m+1,e), combine(s,e,l,r);
		else {
			own(s,e);
		}
	}
	void combine(ll s,ll e,node* l, node* r){
		ll m=(s+e)>>1;
		FOR(i,0,M-1)FOR(j,0,M-1)dp[i][j]=INF;
		vector<ll> gaps={0,M-1};
		DEC(d,M-1,0){
			vector<ll> ngaps;
			assert(M-1-d+2==siz(gaps));
			FOR(i,0,M-1-d){
				ll j=i+d;
				ll opt=-1, best=INF;
				FOR(k,gaps[i],gaps[i+1]){
					ll val=l->dp[i][k]+r->dp[k][j]+C[m][k];
					if(val<best)best=val,opt=k;
				}
				assert(~opt);
				dp[i][j]=best, ngaps.eb(opt);
			}
			gaps=ngaps;
			gaps.eb(M-1);
			gaps.insert(gaps.begin(), 0);
		}
		gaps={0,M-1};
		DEC(d,M-1,1){
			vector<ll> ngaps;
			assert(M-1-d+2==siz(gaps));
			FOR(i,d,M-1){
				ll j=i-d;
				ll opt=-1, best=INF;
				FOR(k,gaps[i-d],gaps[i-d+1]){
					ll val=l->dp[i][k]+r->dp[k][j]+C[m][k];
					if(val<best)best=val,opt=k;
				}
				assert(~opt);
				dp[i][j]=best, ngaps.eb(opt);
			}
			gaps=ngaps;
			gaps.eb(M-1);
			gaps.insert(gaps.begin(), 0);
		}
	}
	void update(ll s,ll e,int x){
		if(e-s<15){
			own(s,e);
			return;
		}
		ll m=(s+e)>>1;
		if(x>m)r->update(m+1,e,x);else l->update(s,m,x);
		combine(s,e,l,r);
	}
	void own(ll s,ll e){
		ll ndp[203][203];
		FOR(i,0,M-1)FOR(j,i,M-1)if(i^j)dp[i][j]=dp[i][j-1]+H[s][j-1]; else dp[i][j]=0;
		FOR(i,0,M-1)FOR(j,0,i-1)dp[i][j]=dp[j][i];
		FOR(r,s+1,e){
			FOR(i,0,M-1)FOR(j,0,M-1)ndp[i][j]=INF;
			ll cols[203];cols[0]=0;
			FOR(i,1,M-1)cols[i]=cols[i-1]+H[r][i-1];
			FOR(i,0,M-1)FOR(j,0,M-1)FOR(k,0,M-1){
				ndp[i][j]=min(ndp[i][j],dp[i][k]+abs(cols[j]-cols[k])+C[r-1][k]);
			}
			FOR(i,0,M-1)FOR(j,0,M-1)dp[i][j]=ndp[i][j];
		}
	}
}*seg;
void init(int _r, int _c, int HH[5000][200], int VV[5000][200]) {
    /* ... */
    n=_r, M=_c;
    FOR(i,0,4999)FOR(j,0,199)H[i][j]=HH[i][j],C[i][j]=VV[i][j];
    seg=new node(0, n-1);
}

void changeH(int P, int Q, int W) {
    /* ... */
    H[P][Q]=W;
    seg->update(0,n-1,P);
}

void changeV(int P, int Q, int W) {
    /* ... */
    C[P][Q]=W;
    seg->update(0,n-1,P+1);
}

int escape(int V1, int V2) {
    return seg->dp[V1][V2];
}

Compilation message

grader.c: In function 'int main()':
grader.c:15:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
  int res;
      ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 18688 KB Output is correct
2 Correct 14 ms 18688 KB Output is correct
3 Correct 97 ms 20856 KB Output is correct
4 Correct 13 ms 18688 KB Output is correct
5 Correct 13 ms 18688 KB Output is correct
6 Correct 8 ms 8320 KB Output is correct
7 Correct 6 ms 8320 KB Output is correct
8 Correct 6 ms 8320 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8320 KB Output is correct
2 Correct 9 ms 8320 KB Output is correct
3 Correct 6 ms 8320 KB Output is correct
4 Correct 7 ms 8448 KB Output is correct
5 Correct 7 ms 8448 KB Output is correct
6 Correct 6 ms 8448 KB Output is correct
7 Correct 10 ms 8448 KB Output is correct
8 Correct 7 ms 8448 KB Output is correct
9 Correct 6 ms 8448 KB Output is correct
10 Correct 7 ms 8448 KB Output is correct
11 Correct 94 ms 10104 KB Output is correct
12 Correct 7 ms 8448 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1924 ms 9976 KB Output is correct
2 Correct 1918 ms 9976 KB Output is correct
3 Correct 2004 ms 9920 KB Output is correct
4 Correct 2037 ms 9912 KB Output is correct
5 Correct 1969 ms 9976 KB Output is correct
6 Correct 6 ms 8320 KB Output is correct
7 Correct 6 ms 8320 KB Output is correct
8 Correct 9 ms 8320 KB Output is correct
9 Correct 9288 ms 9980 KB Output is correct
10 Correct 6 ms 8320 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 22656 KB Output is correct
2 Correct 17 ms 22656 KB Output is correct
3 Correct 18 ms 22656 KB Output is correct
4 Correct 58 ms 23928 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1919 ms 9976 KB Output is correct
2 Correct 1933 ms 9892 KB Output is correct
3 Correct 2003 ms 9908 KB Output is correct
4 Correct 2001 ms 9920 KB Output is correct
5 Correct 1949 ms 9848 KB Output is correct
6 Correct 18 ms 22656 KB Output is correct
7 Correct 17 ms 22692 KB Output is correct
8 Correct 17 ms 22656 KB Output is correct
9 Correct 58 ms 23928 KB Output is correct
10 Correct 13 ms 18688 KB Output is correct
11 Correct 13 ms 18688 KB Output is correct
12 Correct 97 ms 20856 KB Output is correct
13 Correct 14 ms 18700 KB Output is correct
14 Correct 14 ms 18688 KB Output is correct
15 Correct 6 ms 8320 KB Output is correct
16 Correct 6 ms 8320 KB Output is correct
17 Correct 6 ms 8320 KB Output is correct
18 Correct 7 ms 8448 KB Output is correct
19 Correct 7 ms 8448 KB Output is correct
20 Correct 7 ms 8448 KB Output is correct
21 Correct 6 ms 8448 KB Output is correct
22 Correct 7 ms 8448 KB Output is correct
23 Correct 9 ms 8448 KB Output is correct
24 Correct 7 ms 8448 KB Output is correct
25 Correct 92 ms 10036 KB Output is correct
26 Correct 7 ms 8448 KB Output is correct
27 Correct 9296 ms 9912 KB Output is correct
28 Correct 14972 ms 104592 KB Output is correct
29 Correct 12406 ms 102888 KB Output is correct
30 Correct 12447 ms 102788 KB Output is correct
31 Correct 15200 ms 106232 KB Output is correct
32 Correct 9 ms 8320 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2007 ms 9904 KB Output is correct
2 Correct 1919 ms 9848 KB Output is correct
3 Correct 2004 ms 9848 KB Output is correct
4 Correct 2017 ms 10104 KB Output is correct
5 Correct 1961 ms 9848 KB Output is correct
6 Correct 17 ms 22656 KB Output is correct
7 Correct 16 ms 22656 KB Output is correct
8 Correct 16 ms 22656 KB Output is correct
9 Correct 58 ms 24056 KB Output is correct
10 Correct 12 ms 18688 KB Output is correct
11 Correct 13 ms 18688 KB Output is correct
12 Correct 95 ms 21240 KB Output is correct
13 Correct 12 ms 18688 KB Output is correct
14 Correct 17 ms 18688 KB Output is correct
15 Execution timed out 20062 ms 77124 KB Time limit exceeded
16 Halted 0 ms 0 KB -