oj.uz

답안 #1095439

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1095439 2024-10-02T08:00:44 Z hqminhuwu Sailing Race (CEOI12_race) C++14
30 / 100
 22 ms 2648 KB 
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <ll,ll> pll;
typedef pair <int,int> pii;
typedef pair <int,pii> piii;

#define forr(_a,_b,_c) for(int _a = (_b); _a <= int (_c); ++_a)
#define ford(_a,_b,_c) for(int _a = (_b) + 1; _a --> int (_c);)
#define forf(_a,_b,_c) for(int _a = (_b); _a < int (_c); ++_a)
#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define mask(i) (1LL << (i))
#define bit(x, i) (((x) >> (i)) & 1)
#define bp __builtin_popcountll
#define file "test"

template<class X, class Y>
    bool minz(X &x, const Y &y) {
        if (x > y) {
            x = y;
            return true;
        } return false;
    }
template<class X, class Y>
    bool maxz(X &x, const Y &y) {
        if (x < y) {
            x = y;
            return true;
        } return false;
    }

const int N = 5e2 + 5;
const ll oo = (ll) 1e16;
const ll mod = 1e9 + 7; // 998244353;

int debug = 0;

int dp[N][N][2], n, t, u;
vector <int> a[N];

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    #ifdef hqm
        freopen(file".inp", "r", stdin); freopen(file".out", "w", stdout);
    #endif

    cin >> n >> t;

    forr (i, 1, n){
        while (cin >> u && u != 0){
            a[u].pb(i);
            a[u + n].pb(i);
            a[u].pb(i + n);
            a[u + n].pb(i + n);
        }
    }

    memset (dp, -1, sizeof dp);

    forr (i, 1, 2 * n){
        for (int u : a[i]){
            if (u < i)
                dp[u][i][0] = 1;
            else dp[i][u][1] = 1;
        }
    }

    int mx = 0, pos = 0;

    forr (len, 1, n){
        forr (i, 1, 2 * n - len + 1){
            int u = i, v = i + len - 1;

            forr (t, 0, 1){
                int e = (t ? v : u);

                if (dp[u][v][t] > mx){
                    mx = dp[u][v][t];
                    pos = e - n * (e > n);
                } 

                if (dp[u][v][t] != -1){
                    if (debug)
                        cout << u << " " << v << " " << t << " " << dp[u][v][t] << "\n";
                    for (int w : a[e]){
                        if (w < u){
                            maxz(dp[w][v][0], dp[u][v][t] + 1);
                        } else if (w > v){
                            maxz(dp[u][w][1], dp[u][v][t] + 1);
                        }
                    }
                }
            }
        }
    }   
    

    cout << mx << " " << pos << "\n";

    return 0;
}
/*



*/

Subtask #1
30.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Incorrect 1 ms 2396 KB Output isn't correct
4 Incorrect 1 ms 2396 KB Output isn't correct
5 Correct 2 ms 2396 KB Output is correct
6 Incorrect 2 ms 2392 KB Output isn't correct
7 Correct 4 ms 2396 KB Output is correct
8 Incorrect 2 ms 2396 KB Output isn't correct
9 Correct 6 ms 2572 KB Output is correct
10 Correct 9 ms 2648 KB Output is correct
11 Correct 8 ms 2396 KB Output is correct
12 Incorrect 22 ms 2644 KB Output isn't correct
13 Runtime error 1 ms 604 KB Execution killed with signal 11
14 Runtime error 1 ms 604 KB Execution killed with signal 11
15 Runtime error 1 ms 604 KB Execution killed with signal 11
16 Runtime error 1 ms 604 KB Execution killed with signal 11
17 Runtime error 1 ms 604 KB Execution killed with signal 11
18 Runtime error 1 ms 604 KB Execution killed with signal 11
19 Runtime error 1 ms 604 KB Execution killed with signal 11
20 Runtime error 1 ms 604 KB Execution killed with signal 11