# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1127303 | Gray | Longest beautiful sequence (IZhO17_subsequence) | C++20 | 3376 ms | 47212 KiB |
#ifndef LOCAL
#pragma GCC target("sse3")
#pragma GCC optimize("Ofast")
#endif
#include <bits/stdc++.h>
using namespace std;
#define ll int
#define ull unsigned long long
#define ld long double
#define ff first
#define ss second
#define ln "\n"
#define mp make_pair
#define popcnt __builtin_popcount
void solve(){
ll n; cin >> n;
int a[n], k[n];
for (ll i=0; i<n; i++){
cin >> a[i];
}
for (ll i=0; i<n; i++){
cin >> k[i];
}
int past[1<<10][1<<10][11];
for (ll i=0; i<(1<<10); i++){
for (ll j=0; j<(1<<10); j++){
for (ll l=0; l<11; l++) past[i][j][l]=-1;
}
}
int ldp[n], dep[n];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |