Submission #92254

#TimeUsernameProblemLanguageResultExecution timeMemory
92254davitmargGift (IZhO18_nicegift)C++17
19 / 100
1053 ms55436 KiB
/* DEATH-MATCH Davit-Marg */ #include <iostream> #include <algorithm> #include <cmath> #include <vector> #include <string> #include <cstring> #include <map> #include <set> #include <queue> #include <deque> #include <stack> #include <iterator> #include <ctype.h> #include <stdlib.h> #include <cassert> #include <fstream> #define mod 998244353ll #define LL long long #define LD long double #define MP make_pair #define PB push_back using namespace std; LL gcd(LL a, LL b) { while (b) { a %= b; swap(a, b); } return a; } LL n,k,a[1000006],d,s; bool hav=1; priority_queue<pair<LL, int>> q; vector<pair<LL, int>> ans; pair<LL, int> mn = {mod*mod,mod}; int main() { cin >> n >> k; for (int i = 0; i < n; i++) { scanf("%lld", a + i); s += a[i]; q.push(MP(a[i],i)); mn = min(mn,MP(a[i],i)); if (i && a[i] != a[i - 1]) hav = 0; } if (!hav) { int step = 0; vector<pair<LL, int>> st; bool br = 0; while (!q.empty() && !br) { for (int i = 0; i < k; i++) { if (q.empty()) { cout << -1 << endl; return 0; } st.PB(q.top()); q.pop(); } LL d= st.back().first; if (!q.empty()) d = min(st.back().first - q.top().first + 1, d); else br = 1; for (int i = k-1; i >=0 ; i--) { ans.PB(MP(d,st[i].second)); a[st[i].second] -= d; if(st[i].first - d > 0) q.push(MP(st[i].first-d,st[i].second)); st.pop_back(); } } } if(1 && a[0]) { d = k / gcd(n, k); if (a[0] % d != 0) { cout << -1 << endl; return 0; } for (LL i = 0; i < d*n; i++) { ans.PB(MP(a[0] / d, (i%n))); } cout << endl; } cout << ans.size() / k; for (int i = 0; i < ans.size(); i++) { if (i%k == 0) cout << endl << ans[i].first << " "; cout << ans[i].second + 1 << " "; } cout << endl; return 0; } /* 4 2 1 1 4 4 4 3 6 6 6 6 14 7 10 10 10 10 10 10 10 10 10 10 10 10 10 10 */

Compilation message (stderr)

nicegift.cpp: In function 'int main()':
nicegift.cpp:57:7: warning: unused variable 'step' [-Wunused-variable]
   int step = 0;
       ^~~~
nicegift.cpp:105:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < ans.size(); i++)
                  ~~^~~~~~~~~~~~
nicegift.cpp:46:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", a + i);
   ~~~~~^~~~~~~~~~~~~~~
#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...