Submission #892565

#TimeUsernameProblemLanguageResultExecution timeMemory
892565NoLoveLongest beautiful sequence (IZhO17_subsequence)C++14
23 / 100
6020 ms3932 KiB
/** * author : Lăng Trọng Đạt * created: 25-12-2023 **/ #include <bits/stdc++.h> using namespace std; #ifndef LANG_DAT #define db(...) ; #endif // LANG_DAT #define int int64_t #define mp make_pair #define f first #define s second #define pb push_back #define all(v) (v).begin(), (v).end() using pii = pair<int, int>; const int MAXN = 1e5 + 5; int g[MAXN], k[MAXN], dp[MAXN], p[MAXN]; int n; int32_t main() { cin.tie(0)->sync_with_stdio(0); if (fopen("hi.inp", "r")) { freopen("hi.inp", "r", stdin); // freopen("hi.out", "w", stdout); } std::cin >> n; for (int i = 0; i < n; i++) { dp[i] = 1; p[i] = i; std::cin >> g[i]; } for (int i = 0; i < n; i++) { std::cin >> k[i]; } int id = 0; for (int i = 1; i < n; i++) { for (int j = 0; j < i; j++) { if (__builtin_popcount(g[i] & g[j]) == k[i] && dp[j] + 1 > dp[i]) { dp[i] = dp[j] + 1; p[i] = j; } } if (dp[i] > dp[id]) { id = i; } } cout << dp[id] << "\n"; // cout << id << " "; vector<int> ans = {id}; while (id != p[id]) { id = p[id]; ans.pb(id); // cout << id << " "; } for (int i = ans.size() - 1; i >= 0; i--) { cout << ans[i] + 1 << " "; } }

Compilation message (stderr)

subsequence.cpp: In function 'int32_t main()':
subsequence.cpp:25:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |         freopen("hi.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...