| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 967010 |
2024-04-21T02:04:28 Z |
Requiem |
Vrtić (COCI18_vrtic) |
C++17 |
|
403 ms |
199440 KB |
#include<bits/stdc++.h>
//#define int long long
#define pb push_back
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define MOD 1000000007
#define INF 1e18
#define fi first
#define se second
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define sz(a) ((int)(a).size())
#define endl '\n'
#define pi 3.14159265359
#define TASKNAME "vrtic"
template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
template<typename T> bool minimize(T &res, const T &val) { if (res >= val){ res = val; return true; }; return false; }
using namespace std;
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
typedef vector<int> vi;
const int MAXN = 159;
int n;
int best_friend[MAXN], bag_of_candy[MAXN];
namespace subtask1{
bool checkSubtask1(){
for(int i = 1; i <= n; i++){
if (best_friend[i] != i % n + 1) return false;
}
return true;
}
int arr[MAXN];
void solveSubtask1(){
int res = 0, splitting_point = 0;
sort(bag_of_candy + 1, bag_of_candy + 1 + n);
int cur = 0;
for(int i = 3; i <= n; i++){
maximize(res, abs(bag_of_candy[i] - bag_of_candy[i - 2]));
}
cout << res << endl;
for(int i = 1; i <= n; i += 2){
cout << bag_of_candy[i] << ' ';
}
for(int i = n - (n & 1); i > 0; i -= 2){
cout << bag_of_candy[i] << ' ';
}
cout << endl;
}
}
namespace subtask2{ //not usable yet
bool checkSubtask2(){
return n <= 20;
}
int MinDistriRange[MAXN][MAXN], ok[MAXN], answer[MAXN];
vector<vector<int>> cycle[MAXN];
vector<vector<int>> Listcycle;
vector<ii> Nxtmask;
int dp[21][(1 << 20)], trace[21][(1 << 20)];
void prep(){
sort(bag_of_candy + 1, bag_of_candy + 1 + n);
for(int i = 1; i <= n; i++){
for(int j = i; j <= n; j++){
int length = j - i + 1;
if (length == 1) MinDistriRange[i][j] = 1;
else if (length == 2) MinDistriRange[i][j] = abs(bag_of_candy[j] - bag_of_candy[i]);
else {
for(int k = i + 2; k <= j; k++){
maximize(MinDistriRange[i][j], abs(bag_of_candy[k] - bag_of_candy[k - 2]) );
}
}
}
}
}
void AssignPermutation(int pos, int msk){
if (pos == 0) return;
int taken = trace[pos][msk];
int numbit = __builtin_popcount(taken);
vector<int> arr;
vector<int> ans;
for(int i = 0; i < n; i++){
if (taken & (1 << i)) arr.pb(bag_of_candy[i + 1]);
}
for(int i = 0; i < numbit; i += 2){
ans.pb(arr[i]);
}
for(int i = numbit - !(numbit&1); i > 0; i -= 2){
ans.pb(arr[i]);
}
// cout << Listcycle[pos - 1].size() << ' ' << arr.size() << endl;
for(int i = 0; i < Listcycle[pos - 1].size(); i++){
answer[Listcycle[pos - 1][i]] = arr[i];
}
AssignPermutation(pos - 1, msk ^ taken);
}
void solveSubtask2(){
prep();
memset(ok, 0, sizeof(ok));
int numcycle = 0;
for(int i = 1; i <= n; i++){
if (ok[i]) continue;
vector<int> oneCycle;
numcycle++;
for(int j = i; !ok[j] ; j = best_friend[j]){
oneCycle.pb(j);
ok[j] = 1;
}
Listcycle.pb(oneCycle);
}
memset(dp, 0x3f, sizeof(dp));
sort(Listcycle.begin(), Listcycle.end(), [&](const vector<int> &a, const vector<int> &b){
return a.size() > b.size();
});
queue<array<int, 3>> q;
q.push({0, 0, 0});
dp[0][0] = 0;
int sz = 0;
// cout << Listcycle.size() << endl;
while(!q.empty()){
int du = q.front()[0];
int pos = q.front()[1];
int msk = q.front()[2];
int testmsk = 0;
q.pop();
if (du > dp[pos][msk] or pos == (int) Listcycle.size()) continue;
int sz = Listcycle[pos].size();
for(int i = 0; i < sz; i++){
testmsk <<= 1;
testmsk++;
}
// cout << sz << ' ' << testmsk << endl;
for(int j = 0; j < n + 1 - sz; j++){
if (((testmsk << j) & msk) == 0) {
if (minimize(dp[pos + 1][msk ^ (testmsk << j)], max(du, MinDistriRange[j + 1][j + sz]))){
q.push({dp[pos + 1][msk ^ (testmsk << j)], pos + 1, msk ^ (testmsk << j) });
trace[pos + 1][msk ^ (testmsk << j)] = (testmsk << j);
}
}
}
}
cout << dp[Listcycle.size()][(1 << n) - 1] << endl;
AssignPermutation(Listcycle.size(), (1 << n) - 1);
for(int i = 1; i <= n; i++){
cout << answer[i] << ' ';
}
cout << endl;
}
}
main()
{
fast;
if (fopen(TASKNAME".inp","r")){
freopen(TASKNAME".inp","r",stdin);
freopen(TASKNAME".out","w",stdout);
}
cin >> n;
for(int i = 1; i <= n; i++){
cin >> best_friend[i];
}
for(int i = 1; i <= n; i++){
cin >> bag_of_candy[i];
}
if (subtask1::checkSubtask1()) return subtask1::solveSubtask1(), 0;
if (subtask2::checkSubtask2()) return subtask2::solveSubtask2(), 0;
}
/**
Warning:
- MLE / TLE?
- Gioi han mang?
- Gia tri max phai luon gan cho -INF
- long long co can thiet khong?
- tran mang.
- code can than hon
- Nho sinh test de tranh RTE / TLE
--> Coi lai truoc khi nop
**/
Compilation message
vrtic.cpp: In function 'void subtask1::solveSubtask1()':
vrtic.cpp:36:22: warning: unused variable 'splitting_point' [-Wunused-variable]
36 | int res = 0, splitting_point = 0;
| ^~~~~~~~~~~~~~~
vrtic.cpp:38:13: warning: unused variable 'cur' [-Wunused-variable]
38 | int cur = 0;
| ^~~
vrtic.cpp: In function 'void subtask2::AssignPermutation(int, int)':
vrtic.cpp:101:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
101 | for(int i = 0; i < Listcycle[pos - 1].size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
vrtic.cpp: In function 'void subtask2::solveSubtask2()':
vrtic.cpp:128:13: warning: unused variable 'sz' [-Wunused-variable]
128 | int sz = 0;
| ^~
vrtic.cpp: At global scope:
vrtic.cpp:162:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
162 | main()
| ^~~~
vrtic.cpp: In function 'int main()':
vrtic.cpp:166:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
166 | freopen(TASKNAME".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
vrtic.cpp:167:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
167 | freopen(TASKNAME".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
210 ms |
154652 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
203 ms |
160840 KB |
the dissatisfaction value doesn't match with your answer |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
403 ms |
199440 KB |
the dissatisfaction value doesn't match with your answer |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
348 KB |
Unexpected end of file - int64 expected |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
348 KB |
Unexpected end of file - int64 expected |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Unexpected end of file - int64 expected |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Unexpected end of file - int64 expected |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
348 KB |
Unexpected end of file - int64 expected |
| 2 |
Halted |
0 ms |
0 KB |
- |
