oj.uz

Submission #3157

# Submission time Handle Problem Language Result Execution time Memory
3157 2013-08-26T11:40:33 Z gs13105 올림픽 피자 (tutorial5) C++
0 / 100
 48 ms 4604 KB 
#include <stdio.h>
#include <memory.h>
#include "pizza.h"

int now,ordernum;
int in[8],arr[100000][8],num[100000];


void Init()
{
	now=0;
	ordernum=0;
	memset(arr,0,sizeof(in));
}

void chk()
{
	int f=1,i;
	if(now!=ordernum)
	{
		for(i=0;i<num[now];i++)
			if(in[arr[now][i]]==0)
				f=0;
		if(f)
		{
			for(i=0;i<num[now];i++)
				in[arr[now][i]]--;
			Bake(now++);
		}
	}
}

void Order(int N,int* A)
{
	int i;
	num[ordernum]=N;
	for(i=0;i<N;i++)
		arr[ordernum][i]=A[i];
	ordernum++;
	chk();
}

void Delivery(int I)
{
	in[I]++;
	chk();
}

Subtask #1
0.0 / 25.0

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

Subtask #2
0.0 / 25.0

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

Subtask #3
0.0 / 20.0

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

Subtask #4
0.0 / 30.0

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