oj.uz

Submission #62908

# Submission time Handle Problem Language Result Execution time Memory
62908 2018-07-30T18:53:47 Z Benq Sailing Race (CEOI12_race) C++11
75 / 100
 3000 ms 5752 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;

bool ok[501][501];
int dp[2][2][501][501];
int N,k;

int nor(int x) { x = (x%N+N)%N; if (x == 0) x += N; return x; }

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

pi solve0() {
    FOR(len,2,N) FOR(i,1,N+1) {
        int en = nor(i+len);
        FOR(j,1,len) {
            int ex = max(dp[0][0][nor(i+j)][en],dp[0][1][i][nor(i+j)])+1;
            if (ok[i][nor(i+j)]) MX(dp[0][0][i][en],ex);
            if (ok[en][nor(i+j)]) MX(dp[0][1][i][en],ex);
        }
    }
    pi ret = {0,0};
    FOR(i,1,N+1) FOR(j,1,N+1) if (ok[i][j]) 
        ret = max(ret,{max(dp[0][1][i][j],dp[0][0][j][i])+1,i});
    return ret;
}

pi solve1() {
    FOR(len,1,N) FOR(i,1,N+1) {
        int en = nor(i+len);
        dp[1][1][i][en] = dp[1][0][i][en] = -MOD;
        F0R(j,len+1) {
            if (ok[nor(i+j)][en]) MX(dp[1][1][i][en],dp[1][1][i][nor(i+j)]+1);
            if (ok[nor(i+j)][i]) MX(dp[1][0][i][en],dp[1][0][nor(i+j)][en]+1);
        }
    }
    pi ret = {0,0};
    FOR(a,1,N+1) FOR(len,1,N+1) if (ok[a][nor(a+len)]) {
        vi l, r;
        FOR(b,1,N+1) if (b != len) {
            if (b < len) l.pb(nor(a+b));
            else r.pb(nor(a+b));
        } 
        for (int i: l) for (int j: r) if (ok[i][j]) 
            ret = max(ret,{1+dp[1][0][i][nor(a+len)]+1+max(dp[0][0][j][a],dp[0][1][nor(a+len)][j]),a});
        for (int i: r) for (int j: l) if (ok[i][j])
            ret = max(ret,{1+dp[1][1][nor(a+len)][i]+1+max(dp[0][0][j][nor(a+len)],dp[0][1][a][j]),a});
    }
    return ret;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> k;
    FOR(i,1,N+1) {
        int x; 
        while (cin >> x) {
            if (x == 0) break;
            ok[i][x] = 1;
        }
    }
    pi t = solve0();
    if (k == 1) t = max(t,solve1());
    cout << t.f << "\n" << t.s;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
75.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 624 KB Output is correct
3 Correct 4 ms 832 KB Output is correct
4 Correct 7 ms 868 KB Output is correct
5 Correct 5 ms 868 KB Output is correct
6 Correct 17 ms 1064 KB Output is correct
7 Correct 9 ms 1064 KB Output is correct
8 Correct 28 ms 1308 KB Output is correct
9 Correct 18 ms 1308 KB Output is correct
10 Correct 12 ms 1308 KB Output is correct
11 Correct 21 ms 1308 KB Output is correct
12 Correct 755 ms 2436 KB Output is correct
13 Correct 1752 ms 3488 KB Output is correct
14 Correct 532 ms 3488 KB Output is correct
15 Execution timed out 3061 ms 5292 KB Time limit exceeded
16 Execution timed out 3053 ms 5348 KB Time limit exceeded
17 Execution timed out 3031 ms 5348 KB Time limit exceeded
18 Correct 1312 ms 5348 KB Output is correct
19 Execution timed out 3061 ms 5584 KB Time limit exceeded
20 Execution timed out 3032 ms 5752 KB Time limit exceeded