Submission #966500

#TimeUsernameProblemLanguageResultExecution timeMemory
966500RequiemVrtić (COCI18_vrtic)C++17
32 / 160
2062 ms197888 KiB
#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; } void solveSubtask2(){ int permutation[21], answer[21]; iota(permutation + 1, permutation + 1 + n, 1); int res = INF; do{ int cur = 0; for(int i = 1; i <= n; i++){ maximize(cur, abs( bag_of_candy[permutation[i]] - bag_of_candy[permutation[best_friend[i]]] ) ); } if (minimize(res, cur)){ cout << "RES: " << res << endl; for(int i = 1; i <= n; i++){ answer[i] = permutation[i]; cout << bag_of_candy[permutation[i]] << ' '; } cout << endl; } }while(next_permutation(permutation + 1, permutation + 1 + n)); cout << res << endl; for(int i = 1; i <= n; i++){ cout << bag_of_candy[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 (stderr)

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: At global scope:
vrtic.cpp:85:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   85 | main()
      | ^~~~
vrtic.cpp: In function 'int main()':
vrtic.cpp:89:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |         freopen(TASKNAME".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
vrtic.cpp:90:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |         freopen(TASKNAME".out","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...
#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...