oj.uz

Submission #332689

# Submission time Handle Problem Language Result Execution time Memory
332689 2020-12-03T03:16:08 Z daniel920712 JOIRIS (JOI16_joiris) C++14
0 / 100
 1 ms 492 KB 
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>

using namespace std;
int all[55];
vector < pair < int , int > > ans;
int main()
{
    int N,M,t=0,ok,small,i,st;
    scanf("%d %d",&N,&M);
    for(i=0;i<N;i++)
    {
        scanf("%d",&all[i]);
        //all[i]=i%2;
        t+=all[i];
    }
    if(t%2==1)
    {
        printf("-1\n");
        return 0;
    }
    else
    {
        while(1)
        {
            ok=1;
            for(i=0;i<N;i+=2)
            {
                if(all[i]==0&&all[i+1]==1) break;
                if(all[i]==1)
                {
                    i=0;
                    break;
                }
            }
            for(i=i;i<N;i+=2)
            {
                st=i;
                if(all[i]==1||all[i+1]==0) ok=0;
            }
            if(ok)
            {

                ans.push_back(make_pair(2,st));
                all[st]++;
                all[st+1]++;
                for(i=st+2;i<N;i++)
                {
                    all[i]+=2;
                    ans.push_back(make_pair(1,i+1));
                }
                all[st]++;
                ans.push_back(make_pair(1,st));
                for(i=0;i<st;i+=2)
                {
                    ans.push_back(make_pair(2,i+1));
                    all[i]++;
                    all[i+1]++;
                }

            }
            else
            {
                for(i=0;i<N;i++)
                {
                    if(all[i]==0)
                    {
                        if(i+1<N&&all[i+1]==0)
                        {
                            ans.push_back(make_pair(2,i+1));
                            all[i]++;
                            all[i+1]++;
                        }
                        else
                        {
                            ans.push_back(make_pair(1,i+1));
                            all[i]+=2;
                        }
                    }
                }

            }

            small=all[0];
            for(i=0;i<N;i++) small=min(small,all[i]);

            for(i=0;i<N;i++) all[i]-=small;
            for(i=0;i<N;i++) if(all[i]) break;

            if(i==N) break;

        }


    }
    printf("%d\n",ans.size());
    for(auto i:ans) printf("%d %d\n",i.first,i.second);
    return 0;
}

Compilation message

joiris.cpp: In function 'int main()':
joiris.cpp:98:14: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wformat=]
   98 |     printf("%d\n",ans.size());
      |             ~^    ~~~~~~~~~~
      |              |            |
      |              int          std::vector<std::pair<int, int> >::size_type {aka long unsigned int}
      |             %ld
joiris.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   12 |     scanf("%d %d",&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~
joiris.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   15 |         scanf("%d",&all[i]);
      |         ~~~~~^~~~~~~~~~~~~~
joiris.cpp:11:28: warning: 'st' may be used uninitialized in this function [-Wmaybe-uninitialized]
   11 |     int N,M,t=0,ok,small,i,st;
      |                            ^~

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 376 KB Output is correct
4 Runtime error 1 ms 492 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 376 KB Output is correct
4 Runtime error 1 ms 492 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 376 KB Output is correct
4 Runtime error 1 ms 492 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -