oj.uz

Submission #66882

# Submission time Handle Problem Language Result Execution time Memory
66882 2018-08-12T17:55:31 Z Benq Sailing Race (CEOI12_race) C++14
100 / 100
 2582 ms 4840 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 N,k;
 
int nor(int x) { 
	if (x <= 0) x += N;
	if (x > N) x -= N;
	return x;
}

template<class T> void MX(T& a, T b) { a = max(a,b); }

int alt[2][501][501];
pi ret = {0,-1};

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

int no[2][501][501];
   
void test2(int len, int i) {
    int en = nor(i+len);
    for (int j = 0; j < len; ++j) {
        int m = nor(i+j); 
        if (j && ok[m][i]) {
            pi t = {no[0][i][en]+max(alt[1][m][en],alt[0][en][i])+1,-m};
            // if (t.f == 194) cout << len << " " << i << " " << no[0][i][en] << " " << alt[1][m][en] << " " << alt[0][en][i] << " " << t.f << " " << t.s << "\n";
            MX(ret,t);
        }
        if (ok[m][en]) MX(no[0][i][en],no[0][i][m]+1);
    }
}

void test4(int len, int i) {
    int st = nor(i-len);
    for (int j = 0; j < len; ++j) {
        int m = nor(i-j);
        if (j && ok[m][i]) MX(ret,{no[1][st][i]+max(alt[0][st][m],alt[1][i][st])+1,-m});
        if (ok[m][st]) MX(no[1][st][i],no[1][m][i]+1);
    }
}

void solve1() {
    F0R(i,2) FOR(j,1,N+1) FOR(k,1,N+1) {
        if (j != k) no[i][j][k] = -MOD;
        else no[i][j][k] = 0;
    }
    
    FOR(len,1,N) FOR(i,1,N+1) {
        test2(len,i);
        test4(len,i);
    }
}
 
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> k;
    // FOR(i,1,N+1) FOR(j,1,N+1) if (i != j) ok[i][j] = rand() % 2;
    FOR(i,1,N+1) {
        int x; 
        while (cin >> x) {
            if (x == 0) break;
            if (i != x) ok[i][x] = 1;
        }
    }
    solve0();
    //cout << "HA " << alt[1][133][126] << "\n";
    if (k == 1) solve1();
    cout << ret.f << "\n" << -ret.s << "\n";
    //FOR(i,1,N+1) if (ok[127][i] && ok[i][126]) cout << i << "\n";
}
 
/* 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
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 416 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 796 KB Output is correct
4 Correct 4 ms 876 KB Output is correct
5 Correct 4 ms 908 KB Output is correct
6 Correct 6 ms 1060 KB Output is correct
7 Correct 5 ms 1060 KB Output is correct
8 Correct 10 ms 1216 KB Output is correct
9 Correct 8 ms 1216 KB Output is correct
10 Correct 6 ms 1216 KB Output is correct
11 Correct 11 ms 1216 KB Output is correct
12 Correct 110 ms 2240 KB Output is correct
13 Correct 300 ms 3108 KB Output is correct
14 Correct 178 ms 3108 KB Output is correct
15 Correct 2165 ms 4752 KB Output is correct
16 Correct 2182 ms 4800 KB Output is correct
17 Correct 2023 ms 4840 KB Output is correct
18 Correct 381 ms 4840 KB Output is correct
19 Correct 2582 ms 4840 KB Output is correct
20 Correct 2369 ms 4840 KB Output is correct