제출 #580231

#제출 시각아이디문제언어결과실행 시간메모리
580231Sam_a17Bali Sculptures (APIO15_sculpture)C++14
100 / 100
749 ms23116 KiB
#define _CRT_SECURE_NO_WARNINGS #include <bits/stdc++.h> //#include "temp.cpp" #include <cstdio> using namespace std; #pragma GCC optimize("Ofast") #ifndef ONLINE_JUDGE #define dbg(x) cerr << #x <<" "; print(x); cerr << endl; #else #define dbg(x) #endif #define sz(x) (int((x).size())) #define len(x) (int)x.length() #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define clr(x) (x).clear() #define uniq(x) x.resize(unique(all(x)) - x.begin()); #define pb push_back #define popf pop_front #define popb pop_back void print(long long t) {cerr << t;} void print(int t) {cerr << t;} void print(string t) {cerr << t;} void print(char t) {cerr << t;} void print(double t) {cerr << t;} void print(long double t) {cerr << t;} void print(unsigned long long t) {cerr << t;} template <class T> void print(set <T> v); template <class T> void print(vector <T> v); template <class T> void print(multiset <T> v); template <class T, class V> void print(map <T, V> v); template <class T, class V> void print(pair <T, V> p); template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";} template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";} template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";} template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";} template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";} template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";} template <class T, class V> void print(unordered_map<T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";} // #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define nl '\n' // for grid problems long long dx[8] = {-1,0,1,0,1,-1,1,-1}; long long dy[8] = {0,1,0,-1,1,1,-1,-1}; // lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6 void fastIO() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); } // file in/out void setIO(string str = "") { fastIO(); if (str != "" && str != "input") { freopen((str + ".in").c_str(), "r", stdin); freopen((str + ".out").c_str(), "w", stdout); } if(str == "input") { freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); } } // Random mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count()); // Indexed Set // template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; const int N = 2e3 + 10, LOG = 8 * sizeof(long long) - 1, inf = 1e8; int n, a, b; long long arr[N], pref[N][N]; bool check1(long long curr, long long bi) { vector<vector<int>> dp(n + 1, vector<int> (n + 1, -1)); dp[0][0] = 1; for(int i = 1; i <= n; i++) { long long s = 0; for(int j = i; j >= 1; j--) { s += arr[j]; for(int k = 0; k < n; k++) { if(dp[j - 1][k] == -1) continue; int is_on = ((((s >> bi) << bi) | curr) == curr ? 1 : 0); if(dp[i][k + 1] == -1) { if(!is_on || !dp[j - 1][k]) { dp[i][k + 1] = 0; } else { dp[i][k + 1] = 1; } } else { if(dp[i][k + 1] == 1) { continue; } if(!is_on || !dp[j - 1][k]) { dp[i][k + 1] = 0; } else { dp[i][k + 1] = 1; } } } } } for(int i = a; i <= b; i++) { if(dp[n][i] == 1) { return true; } } return false; } bool check2(long long curr, long long bi) { vector<int> dp(n + 1, inf); dp[0] = 0; for(int i = 1; i <= n; i++) { for(int j = 1; j <= i; j++) { long long s = pref[j][i]; int is_on = (((s >> bi) << bi) | curr) == curr; if(is_on) { dp[i] = min(dp[i], dp[j - 1] + 1); } } } return dp[n] <= b; } void solve_() { cin >> n >> a >> b; for(int i = 1; i <= n; i++) { cin >> arr[i]; } long long answ = 0; if(a != 1 && n <= 100) { for(int i = LOG; i >= 0; i--) { if(!check1(answ, i)) { answ |= (1ll << i); } } } else { for(int i = 1; i <= n; i++) { for(int j = i; j <= n; j++) { pref[i][j] = pref[i][j - 1] + arr[j]; } } for(int i = LOG; i >= 0; i--) { if(!check2(answ, i)) { answ |= (1ll << i); } } } printf("%lld\n", answ); } int main() { setIO(); auto solve = [&](int test_case)-> void { while(test_case--) { solve_(); } }; int test_cases = 1; solve(test_cases); return 0; }

컴파일 시 표준 에러 (stderr) 메시지

sculpture.cpp: In function 'void setIO(std::string)':
sculpture.cpp:66:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:67:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:71:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:72:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...