Submission #84674

#TimeUsernameProblemLanguageResultExecution timeMemory
84674bashRobots (IOI13_robots)C++17
Compilation error
0 ms0 KiB
/**
SXR0aXAkI0JwbXptI3FhI3Z3I293bCNqY2IjUG0jMCNicG0jVHFkcXZvLyNCcG0jQW10bjBhY2phcWFicXZvLyNNYm16dml0MSNWdyNhdGN1am16I2tpdiNhbXF9bSNQcXUjVnd6I0F0bW14MSNQcWEjaXptI2l0dCNicHF2b2EjUXYjYnBtI3BtaWRtdmEjaXZsI3d2I21pemJwMSNFcHcjcWEjYnBtem0ja2l2I3F2Ym16a21sbSNRdiNQcWEjeHptYW12a20jbXtrbXhiI0lhI3BtI3htenVxYmJtYnBHI1BtI3N2d2VtYnAjRXBpYiMraXh4bWl6bWJwI2J3I1BxYSNrem1pYmN6bWEjSWEsI0ptbnd6bSN3eiNJbmJteiN3eiNKbXBxdmwjYnBtdTEjVnd6I2FwaXR0I2JwbXwja3d1eGlhYSNJY29wYiN3biNwcWEjc3Z3ZXRtbG9tI017a214YiNpYSNQbSNlcXR0bWJwMSNQcWEjYnB6d3ZtI2x3YnAjbXtibXZsI1dkbXojYnBtI3BtaWRtdmEjSXZsI3d2I21pemJwLyNpdmwjUG0jbm1tdG1icCNWdyNuaWJxb2NtI3F2I29jaXpscXZvI0l2bCN4em1hbXpkcXZvI2JwbXUvI053eiNQbSNxYSNicG0jVXdhYiNQcW9wMSNCcG0jQWN4em11bSMrcXYjb3R3enwsMQ==
*/
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>

#define F first
#define S second
#define endl '\n'
#define deb(x) cout<<#x<<' '<<x<<endl;
#define pb push_back

/*
#ifdef IZI_KATKA
#define int __int64_t
#else
#define int __int64
#endif
*/

const long long MOD = 1e9 + 7;
const long long MAXN = 1e6 + 1;
using namespace std;

typedef long long ll;

long long readInt() {
    bool minus1 = false;
    long long result = 0;
    char ch;
    ch = getchar();
    while (true) {
        if (ch == '-') break;
        if (ch >= '0' && ch <= '9') break;
        ch = getchar();
    }
    if (ch == '-') minus1 = true; else result = ch-'0';
    while (true) {
        ch = getchar();
        if (ch < '0' || ch > '9') break;
        result = result*10 + (ch - '0');
    }
    if (minus1)
        return -result;
    else
        return result;
}


int a[MAXN];
int b[MAXN];
const int MX = 1111;
int dp[MX][MX];
int pref[MX];
int perehod[MX][MX];

int sum(int l, int r) {
	return pref[r] - pref[l - 1];
}

int main() {
	#ifdef IZI_KATKA
	assert(freopen("input", "r", stdin));
    assert(freopen("output", "w", stdout));
    #endif
    int n = readInt();
    for (int i = 1; i <= n; i++) {
    	a[i] = readInt();
    	pref[i] = pref[i - 1] + a[i];
    }
    for (int i = 1; i <= n; i++) {
    	b[i] = readInt();
    }
    for (int i = 1; i <= n; i++)  {
    	for (int j = 0; j <= n j++) {
    		dp[i][j] = -MOD;
    	}
    }
    for (int i = 1; i <= n; i++) {
    	dp[i][0] = dp[i - 1][0] + a[i];
    	dp[i][1] = (dp[i - 1][0] >= b[i] ? dp[i - 1][0] - b[i] : -MOD);
    }
    for (int i = 2; i <= n; i++) {
		for (int j = 1; j < i; j++) {
			for (int k = 0; k <= n; k++) {
				if (dp[j][k] + sum(j + 1, i) >= b[i]) {
					dp[i][k + 1] = max(dp[i][k + 1], dp[j][k] + sum(j + 1, i) - b[i]);
			    	perehod[i][k + 1] = j;
				}
			}
		}				
    }
    int mx = 0;
    int kek = 0;
    for (int i = 1; i <= n; i++) {
    	for (int j = 0; j <= n; j++) {
    		if (dp[i][j] != -MOD) {
				mx = max(mx, j);
	    		if (j < mx) {
	    			mx = j;
	    			kek = i;
	    		}
	    	}
    	}
    }
    int f = kek, s = mx;
    vector <int> v;
    while(s != 0) {
    	v.pb(f);
    	f = perehod[f][s];
    	s--;
    }
    sort(v.begin(), v.end());
    cout << mx << ' ' << endl;
    for (int i : v) {
    	cout << i << ' ';
    }
    
    return 0;
}

Compilation message (stderr)

robots.cpp: In function 'int main()':
robots.cpp:94:29: error: expected ';' before 'j'
      for (int j = 0; j <= n j++) {
                             ^