Submission #386712

#TimeUsernameProblemLanguageResultExecution timeMemory
386712vanicGift (IZhO18_nicegift)C++14
30 / 100
2073 ms108952 KiB
#include <cstdio> #include <cmath> #include <algorithm> #include <set> #include <bitset> using namespace std; typedef long long ll; const int maxn=1e6+5; ll a[maxn]; ll sum; ll v[maxn*4]; int ind[maxn*4]; bitset < maxn*4 > stanje; int poz[maxn*4]; set < int > cur; void scan(ll &a){ a=0; char c=getchar(); while(c>='0' && c<='9'){ a*=10; a+=c-'0'; c=getchar(); } } bool cmp(int a1, int b1){ return v[a1]<v[b1]; } int main(){ int n, k; scanf("%d%d", &n, &k); for(int i=0; i<n; i++){ scanf("%lld", a+i); sum+=a[i]; } if(sum%k){ printf("-1\n"); return 0; } sum/=k; for(int i=0; i<n; i++){ if(a[i]>sum){ printf("-1\n"); return 0; } } int pos=0; int iduc; int br=0; for(int i=0; i<n; i++){ iduc=pos+a[i]; if(iduc>sum){ v[br]=pos; ind[br]=br; poz[br]=i+1; stanje[br]=1; br++; v[br]=sum; ind[br]=br; poz[br]=i+1; stanje[br]=0; br++; iduc-=sum; pos=0; } v[br]=pos; ind[br]=br; poz[br]=i+1; stanje[br]=1; br++; v[br]=iduc; ind[br]=br; poz[br]=i+1; stanje[br]=0; br++; if(iduc==sum){ iduc=0; } pos=iduc; } sort(ind, ind+br, cmp); int sol=0; for(int i=0; i<br-1; i++){ if(v[ind[i]]!=v[ind[i+1]]){ sol++; } } printf("%d\n", sol); for(int i=0; i<br-1; i++){ if(stanje[ind[i]]){ cur.insert(poz[ind[i]]); } else{ cur.erase(poz[ind[i]]); } if(v[ind[i]]==v[ind[i+1]]){ continue; } printf("%lld ", v[ind[i+1]]-v[ind[i]]); for(set < int >::iterator it=cur.begin(); it!=cur.end(); it++){ printf("%d ", *it); } printf("\n"); } return 0; }

Compilation message (stderr)

nicegift.cpp: In function 'int main()':
nicegift.cpp:36:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   36 |  scanf("%d%d", &n, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~
nicegift.cpp:38:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   38 |   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...