| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1343165 | Math4Life2020 | Just Long Neckties 2 (JOI25_ho_t4) | C++20 | 1 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long; using pii = pair<ll,ll>;
const ll Mm = 15;
inline ll l2(ll x) {
return (31-__builtin_clz(x));
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
freopen("C:\\Users\\Feodor\\Downloads\\open\\.vscode\\input_1.txt","r",stdin);
ll N; cin >> N;
vector<ll> A(N);
for (ll i=0;i<N;i++) {
cin >> A[i]; A[i]--;
}
for (ll T=1;T<=Mm;T++) {
vector<vector<bool>> dp(N+1,vector<bool>((1<<Mm),0));
dp[0][(1<<T)-1]=1;
for (ll x=1;x<=N;x++) {
vector<ll> vy = {x-1};
if (x>=2) {
vy.push_back(x-2);
}
for (ll y: vy) {
for (ll msk=0;msk<(1<<Mm);msk++) {
if (!dp[y][msk]) {
continue;
}
for (ll z=0;z<=A[x-1];z++) {
if ((msk>>z)&1) {
dp[x][msk^(1<<z)^(1<<A[x-1])]=1;
}
}
}
}
}
for (ll x=(N-1);x<=N;x++) {
for (ll msk=0;msk<(1<<Mm);msk++) {
if (dp[x][msk]) {
cout << T << "\n"; exit(0);
}
}
}
}
}Compilation message (stderr)
| # | 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... | ||||
| # | 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... | ||||
