QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#72832#5120. Power of TwozhouhuanyiWA 181ms5580kbC++112.2kb2023-01-19 17:05:042023-01-19 17:05:07

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-01-19 17:05:07]
  • 评测
  • 测评结果:WA
  • 用时:181ms
  • 内存:5580kb
  • [2023-01-19 17:05:04]
  • 提交

answer

#include<iostream>
#include<cstdio>
#include<vector>
#define N 65536
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
int T,n,x,y,z,rcnt[N+1];
bool used[N+1];
vector<int>p[N+1];
int main()
{
    vector<int>A;
    vector<int>B;
    vector<int>C;
    vector<int>D;
    int d,op;
    T=read();
    while (T--)
    {
	n=read(),x=read(),z=read(),y=read(),A.clear(),B.clear(),C.clear(),D.clear();
	for (int i=0;i<=n-1;++i) rcnt[i]=used[i]=0;
	for (int i=1;i<=n;++i) d=read(),rcnt[d]++;
	if (x)
	{
	    op=1;
	    for (int i=n-1;i>=0;--i)
		if (rcnt[i])
		{
		    if (y) y--,C.push_back(i),rcnt[i]--,used[i]=1;
		    else if (z) z--,D.push_back(i),rcnt[i]--,used[i]=1;
		    while (rcnt[i])
		    {
			if (x) x--,B.push_back(i),rcnt[i]--;
			else if (y) y--,C.push_back(i),rcnt[i]--;
			else z--,D.push_back(i),rcnt[i]--;
		    }
		}
	    for (int i=1;i<B.size();++i) op&=(B[0]==B[i]);
	    for (int i=0;i<=n-1;++i) rcnt[i]=0;
	    for (int i=0;i<C.size();++i) rcnt[C[i]]++;
	    for (int i=0;i<=n-1;++i)
		if (rcnt[i]&&!(rcnt[i]&1))
		{
		    if (op&&B[0]==i) A.push_back(i),A.push_back(i),rcnt[i]-=2;
		    else A.push_back(i),rcnt[i]--;
		}
	    C.clear();
	    for (int i=0;i<=n-1;++i)
		for (int j=1;j<=rcnt[i];++j)
		    C.push_back(i);
	}
	else
	{
	    for (int i=n-1;i>=0;--i)
		if (rcnt[i])
		{
		    used[i]=1;
		    if (!(rcnt[i]&1))
		    {
			if (z) D.push_back(i),rcnt[i]--,z--;
			else used[i]=0;
		    }
		}
	    for (int i=n-1;i>=0;--i)
		while (rcnt[i]&&z)
		    D.push_back(i),rcnt[i]--,z--;
	    for (int i=0;i<=n-1;++i)
		for (int j=1;j<=rcnt[i];++j)
		    C.push_back(i);
	}
	for (int i=n-1;i>=0;--i) printf("%d",used[i]);
	puts("");
	for (int i=0;i<A.size();++i) printf("^");
	for (int i=0;i<B.size();++i) printf("&");
	for (int i=0;i<C.size();++i) printf("^");
	for (int i=0;i<D.size();++i) printf("|");
	puts("");
	for (int i=0;i<A.size();++i) printf("%d ",A[i]);
	for (int i=0;i<B.size();++i) printf("%d ",B[i]);
	for (int i=0;i<C.size();++i) printf("%d ",C[i]);
	for (int i=0;i<D.size();++i) printf("%d ",D[i]);
	puts("");
    }
    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 3ms
memory: 5104kb

input:

4
4 3 0 1
1 0 1 0
4 1 0 3
1 0 1 0
8 0 2 6
1 5 5 7 1 5 5 7
8 0 0 8
1 5 5 7 1 5 5 7

output:

0010
&&&^
1 0 0 1 
0011
^&^^
0 1 0 1 
10100000
^^^^^^||
1 1 5 5 5 7 7 5 
00000000
^^^^^^^^
1 1 5 5 5 5 7 7 

result:

ok ok the answer is correct (4 test cases)

Test #2:

score: -100
Wrong Answer
time: 181ms
memory: 5580kb

input:

16
65511 1 1 65509
42389 52308 9452 29149 28980 48173 38152 51625 29991 48293 12319 38611 47245 11954 45410 33185 30976 56806 18986 35564 25430 48493 26311 19090 42172 33403 62406 15847 51266 33712 53139 15610 50006 62298 28716 19191 3057 35733 12331 14483 9604 16610 18534 32110 35673 5239 31310 279...

output:

011100011111111101111001001110101111111101101101011111011100100111011110101110111110111001110100111101110110111100111101101101111110110101011011111111011111110111000110010000010111011100111101111101111111010001010110100100000110101000001011101011001111110011101111010011101101111010101110011101111110...

result:

wrong answer wrong construction (test case 4)