oj.uz

Submission #745

# Submission time Handle Problem Language Result Execution time Memory
745 2013-03-01T16:15:25 Z CodingIsHard 올림픽 피자 (tutorial5) C++
100 / 100
 82 ms 1228 KB 
#include "pizza.h"
#include <queue>
using namespace std;

int num , can;
int rest[8];
queue<int> p[256];

void Init() {}

void process(int pizza)
{
    Bake(p[pizza].front());
    p[pizza].pop();
    for(int i = 0;i < 8;i++)
    {
        if(pizza & (1 << i))
        {
            rest[i]--;
            if(rest[i] == 0)
                can ^= 1 << i;
        }
    }
}

void Order(int N, int *A)
{
    int pizza = 0;
    for(int i = 0;i < N;i++)
        pizza |= 1 << A[i];
    
    p[pizza].push(num++);
    if((pizza & can) == pizza)
        process(pizza);
}

void Delivery(int I)
{
    if(++rest[I] == 1)
        can |= 1 << I;

    while(true)
    {
        int iMin = -1;
        for(int i = 1;i < 256;i++)
        {
            if((i & can) == i && !p[i].empty() && (iMin == -1 || p[i].front() < p[iMin].front()))
                iMin = i;
        }
        
        if(iMin == -1)
            break;
        
        else
            process(iMin);
    }
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1096 KB Output is correct
2 Correct 0 ms 1096 KB Output is correct
3 Correct 0 ms 1096 KB Output is correct
4 Correct 0 ms 1096 KB Output is correct
5 Correct 0 ms 1096 KB Output is correct
6 Correct 0 ms 1096 KB Output is correct
7 Correct 0 ms 1096 KB Output is correct
8 Correct 0 ms 1096 KB Output is correct
9 Correct 0 ms 1096 KB Output is correct
10 Correct 0 ms 1096 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1096 KB Output is correct
2 Correct 4 ms 1096 KB Output is correct
3 Correct 4 ms 1096 KB Output is correct
4 Correct 3 ms 1096 KB Output is correct
5 Correct 3 ms 1096 KB Output is correct
6 Correct 3 ms 1096 KB Output is correct
7 Correct 2 ms 1096 KB Output is correct
8 Correct 2 ms 1096 KB Output is correct
9 Correct 4 ms 1096 KB Output is correct
10 Correct 3 ms 1096 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 1096 KB Output is correct
2 Correct 69 ms 1096 KB Output is correct
3 Correct 71 ms 1096 KB Output is correct
4 Correct 71 ms 1096 KB Output is correct
5 Correct 70 ms 1228 KB Output is correct
6 Correct 67 ms 1228 KB Output is correct
7 Correct 65 ms 1096 KB Output is correct
8 Correct 73 ms 1228 KB Output is correct
9 Correct 66 ms 1096 KB Output is correct
10 Correct 68 ms 1096 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 1096 KB Output is correct
2 Correct 78 ms 1096 KB Output is correct
3 Correct 80 ms 1096 KB Output is correct
4 Correct 77 ms 1096 KB Output is correct
5 Correct 74 ms 1096 KB Output is correct
6 Correct 79 ms 1096 KB Output is correct
7 Correct 78 ms 1096 KB Output is correct
8 Correct 79 ms 1096 KB Output is correct
9 Correct 79 ms 1096 KB Output is correct
10 Correct 82 ms 1096 KB Output is correct