oj.uz

Submission #378605

# Submission time Handle Problem Language Result Execution time Memory
378605 2021-03-17T02:11:37 Z daniel920712 Gift (IZhO18_nicegift) C++14
7 / 100
 2000 ms 93732 KB 
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <stack>
#include <map>

using namespace std;
map < int , stack < int > > all;
int tt[1000005];
int main()
{
    int N,K,i,j,ans=0,x,y,a,b,t;
    scanf("%d %d",&N,&K);
    for(i=1;i<=N;i++)
    {
        scanf("%d",&t);
        all[t].push(i);
        ans+=t;
        tt[i]=t;
    }
    if(ans%K||N==2&&tt[1]!=tt[2]) printf("-1\n");
    else
    {
        printf("%d\n",ans/K);
        while(!all.empty())
        {
            x=all.begin()->second.top();
            a=all.begin()->first;
            all[a].pop();

            y=prev(all.end())->second.top();
            b=prev(all.end())->first;
            all[b].pop();
            printf("1 %d %d\n",x,y);


            if(all[a].empty()) all.erase(a);
            if(a!=b&&all[b].empty()) all.erase(b);
            if(a!=1) all[a-1].push(x);
            if(b!=1) all[b-1].push(y);
        }
    }
    return 0;
}

Compilation message

nicegift.cpp: In function 'int main()':
nicegift.cpp:21:19: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   21 |     if(ans%K||N==2&&tt[1]!=tt[2]) printf("-1\n");
      |               ~~~~^~~~~~~~~~~~~~
nicegift.cpp:12:15: warning: unused variable 'j' [-Wunused-variable]
   12 |     int N,K,i,j,ans=0,x,y,a,b,t;
      |               ^
nicegift.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   13 |     scanf("%d %d",&N,&K);
      |     ~~~~~^~~~~~~~~~~~~~~
nicegift.cpp:16:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   16 |         scanf("%d",&t);
      |         ~~~~~^~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB n=4
2 Correct 1 ms 492 KB n=3
3 Correct 1 ms 364 KB n=3
4 Correct 1 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 1 ms 364 KB n=2

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB n=4
2 Correct 1 ms 492 KB n=3
3 Correct 1 ms 364 KB n=3
4 Correct 1 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 1 ms 364 KB n=2
7 Correct 1 ms 364 KB n=5
8 Runtime error 5 ms 492 KB Execution killed with signal 11
9 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB n=4
2 Correct 1 ms 492 KB n=3
3 Correct 1 ms 364 KB n=3
4 Correct 1 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 1 ms 364 KB n=2
7 Correct 1 ms 364 KB n=5
8 Runtime error 5 ms 492 KB Execution killed with signal 11
9 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2079 ms 93732 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB n=4
2 Correct 1 ms 492 KB n=3
3 Correct 1 ms 364 KB n=3
4 Correct 1 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 1 ms 364 KB n=2
7 Correct 1 ms 364 KB n=5
8 Runtime error 5 ms 492 KB Execution killed with signal 11
9 Halted 0 ms 0 KB -