#include <iostream>
#include <stdio.h>
#include <vector>
#include <set>
using namespace std;
const long long MAXN=1000005;
long long a[MAXN], ansL[MAXN];
void SubTaskFour(long long n, long long k, long long h);
void SubTaskTwo(long long n, long long k);
int main()
{
long long n, k;
cin>>n>>k;
for (int i=0; i<n; i++)
scanf("%lld", a+i);
bool isSubTaskFour=true;
for (int i=1; i<n; i++)
if (a[i]!=a[0])
{
isSubTaskFour=false;
break;
}
if (isSubTaskFour)
SubTaskFour(n, k, a[0]);
else if (k==2)
SubTaskTwo(n, k);
char I;
cin >> I;
return 0;
}
void SubTaskFour(long long n, long long k, long long h)
{
if ((n*h)%k)
{
cout<<"-1\n";
return;
}
long long l=1, r=k, l_i=1, r_i=1;
long long numRep=1;
while (r_i<=h)
{
if (l==1 && l_i!=1)
{
numRep=h/(l_i-1);
break;
}
ansL[l]++;
l=r+1;
l_i=r_i;
if (l>n)
{
l%=n;
l_i++;
}
if (l+k-1<=n)
{
r=l+k-1;
r_i=l_i;
}
else
{
r=(l+k-1)%n;
r_i=l_i+1;
}
}
long long op=0;
for (long long curL=1; curL<=n; curL++)
if (ansL[curL])
op++;
cout<<op<<'\n';
for (long long curL=1; curL<=n; curL++)
{
if (!ansL[curL]) continue;
long long tempK=k, i=curL;
printf("%lld ", numRep*ansL[curL]);
while (tempK--)
{
printf("%lld ", i);
i++;
if (i>n) i%=n;
}
printf("\n");
}
}
void SubTaskTwo(long long n, long long k)
{
set<pair<long long, long long> > col;
vector<pair<long long, long long> > ans;
for (int i=0; i<n; i++)
col.insert(make_pair(a[i], i+1));
while (!col.empty())
{
while (!col.empty() && !col.begin()->first)
col.erase(col.begin());
if (col.empty())
break;
if (col.size()>=2)
{
set<pair<long long, long long> >::reverse_iterator
it[2]={col.rbegin(), ++col.rbegin()};
ans.push_back(make_pair(it[0]->second, it[1]->second));
long long ind[2], hei[2];
for (int i=0; i<=1; i++)
ind[i]=it[i]->second, hei[i]=it[i]->first;
for (int i=0; i<=1; i++)
{
col.erase(col.find(make_pair(hei[i], ind[i])));
hei[i]--;
col.insert(make_pair(hei[i], ind[i]));
}
}
else
break;
}
if (col.empty())
{
cout<<ans.size()<<'\n';
for (int i=0; i<ans.size(); i++)
printf("1 %lld %lld\n", ans[i].first, ans[i].second);
}
else
cout<<"-1\n";
}
Compilation message
nicegift.cpp: In function 'void SubTaskTwo(long long int, long long int)':
nicegift.cpp:123:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i=0; i<ans.size(); i++)
~^~~~~~~~~~~
nicegift.cpp: In function 'int main()':
nicegift.cpp:17:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld", a+i);
~~~~~^~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
n=4 |
| 2 |
Correct |
2 ms |
256 KB |
n=3 |
| 3 |
Correct |
2 ms |
376 KB |
n=3 |
| 4 |
Correct |
2 ms |
376 KB |
n=4 |
| 5 |
Correct |
2 ms |
376 KB |
n=4 |
| 6 |
Correct |
2 ms |
376 KB |
n=2 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
n=4 |
| 2 |
Correct |
2 ms |
256 KB |
n=3 |
| 3 |
Correct |
2 ms |
376 KB |
n=3 |
| 4 |
Correct |
2 ms |
376 KB |
n=4 |
| 5 |
Correct |
2 ms |
376 KB |
n=4 |
| 6 |
Correct |
2 ms |
376 KB |
n=2 |
| 7 |
Correct |
2 ms |
376 KB |
n=5 |
| 8 |
Correct |
3 ms |
760 KB |
n=8 |
| 9 |
Correct |
6 ms |
760 KB |
n=14 |
| 10 |
Correct |
6 ms |
788 KB |
n=11 |
| 11 |
Correct |
50 ms |
4708 KB |
n=50000 |
| 12 |
Correct |
44 ms |
4800 KB |
n=50000 |
| 13 |
Correct |
17 ms |
1520 KB |
n=10 |
| 14 |
Correct |
20 ms |
1644 KB |
n=685 |
| 15 |
Correct |
23 ms |
1648 KB |
n=623 |
| 16 |
Correct |
14 ms |
1140 KB |
n=973 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
n=4 |
| 2 |
Correct |
2 ms |
256 KB |
n=3 |
| 3 |
Correct |
2 ms |
376 KB |
n=3 |
| 4 |
Correct |
2 ms |
376 KB |
n=4 |
| 5 |
Correct |
2 ms |
376 KB |
n=4 |
| 6 |
Correct |
2 ms |
376 KB |
n=2 |
| 7 |
Correct |
2 ms |
376 KB |
n=5 |
| 8 |
Correct |
3 ms |
760 KB |
n=8 |
| 9 |
Correct |
6 ms |
760 KB |
n=14 |
| 10 |
Correct |
6 ms |
788 KB |
n=11 |
| 11 |
Correct |
50 ms |
4708 KB |
n=50000 |
| 12 |
Correct |
44 ms |
4800 KB |
n=50000 |
| 13 |
Correct |
17 ms |
1520 KB |
n=10 |
| 14 |
Correct |
20 ms |
1644 KB |
n=685 |
| 15 |
Correct |
23 ms |
1648 KB |
n=623 |
| 16 |
Correct |
14 ms |
1140 KB |
n=973 |
| 17 |
Incorrect |
2 ms |
376 KB |
Unexpected end of file - int32 expected |
| 18 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
303 ms |
30184 KB |
n=1000000 |
| 2 |
Correct |
192 ms |
27648 KB |
n=666666 |
| 3 |
Correct |
112 ms |
15856 KB |
n=400000 |
| 4 |
Correct |
239 ms |
25720 KB |
n=285714 |
| 5 |
Correct |
7 ms |
1016 KB |
n=20000 |
| 6 |
Correct |
210 ms |
20728 KB |
n=181818 |
| 7 |
Correct |
4 ms |
760 KB |
n=10000 |
| 8 |
Correct |
28 ms |
2168 KB |
n=6666 |
| 9 |
Correct |
3 ms |
504 KB |
n=4000 |
| 10 |
Correct |
153 ms |
9476 KB |
n=2857 |
| 11 |
Correct |
2 ms |
380 KB |
n=2000 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
n=4 |
| 2 |
Correct |
2 ms |
256 KB |
n=3 |
| 3 |
Correct |
2 ms |
376 KB |
n=3 |
| 4 |
Correct |
2 ms |
376 KB |
n=4 |
| 5 |
Correct |
2 ms |
376 KB |
n=4 |
| 6 |
Correct |
2 ms |
376 KB |
n=2 |
| 7 |
Correct |
2 ms |
376 KB |
n=5 |
| 8 |
Correct |
3 ms |
760 KB |
n=8 |
| 9 |
Correct |
6 ms |
760 KB |
n=14 |
| 10 |
Correct |
6 ms |
788 KB |
n=11 |
| 11 |
Correct |
50 ms |
4708 KB |
n=50000 |
| 12 |
Correct |
44 ms |
4800 KB |
n=50000 |
| 13 |
Correct |
17 ms |
1520 KB |
n=10 |
| 14 |
Correct |
20 ms |
1644 KB |
n=685 |
| 15 |
Correct |
23 ms |
1648 KB |
n=623 |
| 16 |
Correct |
14 ms |
1140 KB |
n=973 |
| 17 |
Incorrect |
2 ms |
376 KB |
Unexpected end of file - int32 expected |
| 18 |
Halted |
0 ms |
0 KB |
- |
