Submission #475485

#TimeUsernameProblemLanguageResultExecution timeMemory
475485NhatMinh0208Gift (IZhO18_nicegift)C++14
100 / 100
1394 ms76780 KiB
#ifndef CPL_TEMPLATE #define CPL_TEMPLATE /* Normie's Template v2.5 Changes: Added warning against using pragmas on USACO. */ // Standard library in one include. #include <bits/stdc++.h> using namespace std; // ordered_set library. #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update> // AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.) //#include <atcoder/all> //using namespace atcoder; //Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.) #pragma comment(linker, "/stack:200000000") #pragma GCC optimize("Ofast,unroll-loops,tree-vectorize") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") //File I/O. #define FILE_IN "cseq.inp" #define FILE_OUT "cseq.out" #define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout) //Fast I/O. #define fio ios::sync_with_stdio(0);cin.tie(0) #define nfio cin.tie(0) #define endl "\n" //Order checking. #define ord(a,b,c) ((a>=b)and(b>=c)) //min/max redefines, so i dont have to resolve annoying compile errors. #define min(a,b) (((a)<(b))?(a):(b)) #define max(a,b) (((a)>(b))?(a):(b)) // Fast min/max assigns to use with AVX. // Requires g++ 9.2.0. template<typename T> __attribute__((always_inline)) void chkmin(T& a, const T& b) { a=(a<b)?a:b; } template<typename T> __attribute__((always_inline)) void chkmax(T& a, const T& b) { a=(a>b)?a:b; } //Constants. #define MOD (ll(998244353)) #define MAX 300001 #define mag 320 const long double PI=3.14159265358979; //Pairs and 3-pairs. #define p1 first #define p2 second.first #define p3 second.second #define fi first #define se second #define pii(element_type) pair<element_type,element_type> #define piii(element_type) pair<element_type,pii(element_type)> //Quick power of 2. #define pow2(x) (ll(1)<<x) //Short for-loops. #define ff(i,__,___) for(int i=__;i<=___;i++) #define rr(i,__,___) for(int i=__;i>=___;i--) //Typedefs. #define bi BigInt typedef long long ll; typedef long double ld; typedef short sh; // Binpow and stuff ll BOW(ll a, ll x, ll p) { if (!x) return 1; ll res=BOW(a,x/2,p); res*=res; res%=p; if (x%2) res*=a; return res%p; } ll INV(ll a, ll p) { return BOW(a,p-2,p); } //---------END-------// #endif vector<ll> vec; vector<vector<ll>> vec2; vector<ll> vec3; ll n,m,i,j,k,t,t1,u,v,a,b; ll arr[1000001]; ll summ; struct cmp { ll operator()(int i,int j) const { if (arr[i]-arr[j]) return (arr[i]<arr[j]); return (i<j); } }; priority_queue<int,vector<int>,cmp> lmao; int main() { fio; cin>>n>>m; for (i=1;i<=n;i++) { cin>>arr[i]; summ+=arr[i]; lmao.push(i); } lmao.push(0); while(true) { vec.clear(); for (i=0;i<m;i++) { vec.push_back(lmao.top()); lmao.pop(); t++; assert(t<=3e6); } u=arr[vec[m-1]]; if (arr[lmao.top()]*m>summ) break; else u=min(u,(summ-(arr[lmao.top()]*m))/m); a=1; for (auto g : vec) { if (!arr[g]) a=0; } if (!a) break; for (auto g : vec) { arr[g]-=u; lmao.push(g); } vec2.push_back(vec); vec3.push_back(u); summ-=m*u; } for (i=1;i<=n;i++) if (arr[i]) { cout<<"-1"; return 0; } cout<<vec2.size()<<endl; for (i=0;i<vec2.size();i++) { cout<<vec3[i]; for (auto g : vec2[i]) cout<<' '<<g; cout<<endl; } } // N;

Compilation message (stderr)

nicegift.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      | 
nicegift.cpp: In function 'int main()':
nicegift.cpp:152:15: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  152 |     for (i=0;i<vec2.size();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...