Submission #582157

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
582157	2022-06-23T12:57:49 Z	YaserFaisal	Library (JOI18_library)	C++14	Compilation error	0 ms	0 KB

library

#include <bits/stdc++.h>
using namespace std;


namespace {
struct Judge
{
	int N;
	int A[1002];
	int pos[1002];
	bool f[1002];
	int query_c;
	bool answered;
	void init()
	{
		query_c=0;
		int ret=scanf("%d",&N); ret++;
		answered=false;
		for(int i=0;i<N;i++)ret=scanf("%d",&A[i]),pos[A[i]]=i;
	}
	int query(const vector<int>& M)
	{
		if(query_c==20000)
		{
			puts("Wrong Answer [3]");
			exit(0);
		}
		if(int(M.size())!=N)
		{
			puts("Wrong Answer [1]");
			exit(0);
		}
		bool all_zero=true;
		for(int i=0;i<N;i++)
		{
			if(M[i]!=0&&M[i]!=1)
			{
				puts("Wrong Answer [2]");
				exit(0);
			}
			if(M[i]==1)all_zero=false;
		}
		if(all_zero)
		{
			puts("Wrong Answer [2]");
			exit(0);
		}
		memset(f,0,sizeof(f));
		for(int i=0;i<N;i++)if(M[i])f[pos[i+1]]=true;
		bool las=false;
		int r=0;
		for(int i=0;i<N;i++)
		{
			if(las==false&&f[i]==true)r++;
			las=f[i];
		}
		query_c++;
		return r;
	}
	void answer(const vector<int>& res)
	{
		bool f1=true,f2=true;
		if(int(res.size())!=N)
		{
			puts("Wrong Answer　[4]");
			exit(0);
		}
		if(answered)
		{
			puts("Wrong Answer [7]");
			exit(0);
		}
		answered=true;
		memset(f,0,sizeof(f));
		for(int i=0;i<N;i++)
		{
			if(res[i]<=0||res[i]>N)
			{
				puts("Wrong Answer [5]");
				exit(0);
			}
			if(f[res[i]])
			{
				puts("Wrong Answer [6]");
				exit(0);
			}
			f[res[i]]=true;
		}
		for(int i=0;i<N;i++)
		{
			f1&=A[i]==res[i];
			f2&=A[i]==res[N-i-1];
		}
		if(!f1&&!f2)
		{
			puts("Wrong Answer　[8]");
			exit(0);
		}
	}
	void end()
	{
		if(!answered)puts("Wrong Answer [7]");
		else printf("Accepted : %d\n",query_c);
	}
}judge;
}

int Query(const vector<int>& M)
{
	return judge.query(M);
}
void Answer(const vector<int>& res)
{
	judge.answer(res);
}
void Solve(int n)
{
    if ( n == 1 )
    {
        vector < int > x = {1} ;
        Answer(x) ;
        return ;
    }
	vector < int > ans , v(n,0) , cur ;
    for ( int i = 0 ; i < n ; i++ )
    {
        int sum = 0 ; 
        for ( int j = 0 ; j < n ; j++ )
        {
            if ( i == j ) continue;
            cur = v ;
            cur[i] = cur[j] = 1 ;
            if ( Query(cur) == 1 ) sum++ ;
        }
        if ( sum == 1 ) { ans.push_back(i) ; break ; }
    }
    
    for ( int i = 1 ; i < n ; i++ )
    {
        int m = ans.size() - 1 ;
        v[ans[m]] = 1 ;
        for ( int j = 0 ; j < n ; j++ )
        {
            if ( v[j] == 1 ) continue;
            cur = v ;
            cur[j] = 1 ;
            if ( Query(cur) == 1 )
            {
                ans.push_back(j) ;
                break ;
            }
        }
    }
    
    for ( int i = 0 ; i < n ; i++ ) ans[i]++ ;
    Answer(ans) ;
}
int main()
{
	judge.init();
	Solve(judge.N);
	judge.end();
}

Compilation message

/usr/bin/ld: /tmp/ccpcNBRf.o: in function `Query(std::vector<int, std::allocator<int> > const&)':
library.cpp:(.text+0x150): multiple definition of `Query(std::vector<int, std::allocator<int> > const&)'; /tmp/cc91d90g.o:grader.cpp:(.text+0xc0): first defined here
/usr/bin/ld: /tmp/ccpcNBRf.o: in function `Answer(std::vector<int, std::allocator<int> > const&)':
library.cpp:(.text+0x2d0): multiple definition of `Answer(std::vector<int, std::allocator<int> > const&)'; /tmp/cc91d90g.o:grader.cpp:(.text+0xe0): first defined here
/usr/bin/ld: /tmp/ccpcNBRf.o: in function `main':
library.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/cc91d90g.o:grader.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status