oj.uz

답안 #317194

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
317194 2020-10-29T05:17:39 Z daniel920712 DEL13 (info1cup18_del13) C++14
30 / 100
 98 ms 131076 KB 
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <queue>
#include <map>
#include <stack>

using namespace std;
int all[100005];
int Father[1000005];
int Father2[1000005];
bool have[1000005];
vector < int > tt;
vector < int > ans;
int T,N,M;
stack < int > aaa;
int F(int l,int r)
{
    int x,ok=1,i,y;
    tt.clear();
    while(!aaa.empty()) aaa.pop();
    for(i=l;i<=r;i++)
    {
        if(i==0)
        {
            if(all[i]!=1) tt.push_back(all[i]-1);
        }
        else if(all[i]-all[i-1]-1) tt.push_back(all[i]-all[i-1]-1);
    }
    if(r==M-1)
    {
        if(all[r]!=N) tt.push_back(N-all[r]);
    }
    else if(all[r+1]-all[r]-1)
    {
        tt.push_back(all[r+1]-all[r]-1);
    }
    if(tt.empty()) return 1;
    if(tt.size()==1) return 0;
    x=0;
    for(auto i:tt)
    {
        x+=i;
        if(i%2==0)
        {
            if(!aaa.empty()&&aaa.top()==0) aaa.pop();
            else aaa.push(0);
        }
        else aaa.push(1);
    }
    if(x%2==1) return 0;
    if(aaa.empty()) return 1;
    x=aaa.top();
    while(!aaa.empty())
    {
        y=aaa.top();
        aaa.pop();
    }
    if(x==0||y==0) return 0;
    return 1;
}
void Find(int here)
{
    int i;
    //printf("%d\n",here);
    if(have[here]) return;
    have[here]=1;
    vector < int > tt;
    for(i=0;i<N;i++)
    {
        if(here&(1<<i)) tt.push_back(i);
    }
    for(i=1;i<tt.size()-1;i++)
    {
        Father[here-(1<<tt[i-1])-(1<<tt[i+1])]=here;
        Father2[here-(1<<tt[i-1])-(1<<tt[i+1])]=tt[i];
        Find(here-(1<<tt[i-1])-(1<<tt[i+1]));
    }
}
void FF(int here)
{
    int i;
    //printf("%d\n",here);
    if(here==(1<<N)-1) return;
    FF(Father[here]);
    ans.push_back(Father2[here]);
}
int main()
{
    int i,j,con,xx=0,ok=0,last,tt=0,ff=0;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d %d",&N,&M);
        if((!ok||N==ff)&&N<=18)
        {
            if(!ok) 
            {
                ff=N;
                Find((1<<N)-1);
            }
            ok=1;
            tt=0;
            for(i=0;i<M;i++)
            {
                scanf("%d",&all[i]);
                all[i]--;
                tt+=(1<<all[i]);
            }
            if(have[tt])
            {
                ans.clear();
                FF(tt);
                printf("%d\n",ans.size());
                for(auto i:ans) printf("%d ",i+1);
                printf("\n");
            }
            else printf("-1\n");
        }
        else
        {
            ok=1;
            last=0;
            for(i=0;i<M;i++) scanf("%d",&all[i]);
            if((N-M)%2) printf("-1\n");
            else
            {

                for(i=1;i<M;i++)
                {
                    if(all[i]-all[i-1]==1)
                    {
                        ok=ok&F(last,i-1);
                        last=i;
                    }
                }
                ok=ok&&F(last,M-1);
                printf("%d\n",ok-1);
            }
        }


    }

    return 0;
}

Compilation message

del13.cpp: In function 'int F(int, int)':
del13.cpp:20:11: warning: unused variable 'ok' [-Wunused-variable]
   20 |     int x,ok=1,i,y;
      |           ^~
del13.cpp: In function 'void Find(int)':
del13.cpp:74:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |     for(i=1;i<tt.size()-1;i++)
      |             ~^~~~~~~~~~~~
del13.cpp: In function 'void FF(int)':
del13.cpp:83:9: warning: unused variable 'i' [-Wunused-variable]
   83 |     int i;
      |         ^
del13.cpp: In function 'int main()':
del13.cpp:115:26: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wformat=]
  115 |                 printf("%d\n",ans.size());
      |                         ~^    ~~~~~~~~~~
      |                          |            |
      |                          int          std::vector<int>::size_type {aka long unsigned int}
      |                         %ld
del13.cpp:91:11: warning: unused variable 'j' [-Wunused-variable]
   91 |     int i,j,con,xx=0,ok=0,last,tt=0,ff=0;
      |           ^
del13.cpp:91:13: warning: unused variable 'con' [-Wunused-variable]
   91 |     int i,j,con,xx=0,ok=0,last,tt=0,ff=0;
      |             ^~~
del13.cpp:91:17: warning: unused variable 'xx' [-Wunused-variable]
   91 |     int i,j,con,xx=0,ok=0,last,tt=0,ff=0;
      |                 ^~
del13.cpp:92:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   92 |     scanf("%d",&T);
      |     ~~~~~^~~~~~~~~
del13.cpp:95:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   95 |         scanf("%d %d",&N,&M);
      |         ~~~~~^~~~~~~~~~~~~~~
del13.cpp:107:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  107 |                 scanf("%d",&all[i]);
      |                 ~~~~~^~~~~~~~~~~~~~
del13.cpp:125:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  125 |             for(i=0;i<M;i++) scanf("%d",&all[i]);
      |                              ~~~~~^~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 8 ms 1024 KB Output is correct
4 Correct 10 ms 1664 KB Output is correct

Subtask #3
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 98 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Runtime error 91 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #4
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 8 ms 1024 KB Output is correct
4 Correct 10 ms 1664 KB Output is correct
5 Incorrect 1 ms 384 KB Output isn't correct
6 Incorrect 6 ms 1536 KB Output isn't correct
7 Incorrect 1 ms 384 KB Output isn't correct

Subtask #5
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 8 ms 1024 KB Output is correct
4 Correct 10 ms 1664 KB Output is correct
5 Incorrect 1 ms 384 KB Output isn't correct
6 Incorrect 6 ms 1536 KB Output isn't correct
7 Incorrect 1 ms 384 KB Output isn't correct
8 Incorrect 6 ms 512 KB Output isn't correct
9 Incorrect 8 ms 384 KB Output isn't correct
10 Incorrect 7 ms 384 KB Output isn't correct
11 Incorrect 7 ms 512 KB Output isn't correct