OJ Board

Code: Select all

import java.util.*;

public class Main
{
	public static void main(String args[])
	{
		Scanner scan = new Scanner(System.in);
		int cases = 0;

		while(true)
		{
			cases++;
			int t = scan.nextInt();

			if(t == 0)
				break;

			int[] h = new int[1000005];

			for(int i=0;i < t;i++)
			{
				int n = scan.nextInt();

				for(int j=0;j < n;j++)
					h[scan.nextInt()] = i;
			}

			Node head = null;
			Node tail = null;
			Node[] p = new Node[t];

			System.out.println("Scenario #" + cases);

			//process
			while(true)
			{
				String str = scan.next();

				if(str.equals("STOP"))
					break;

				if(str.equals("ENQUEUE"))
				{
					int in = scan.nextInt();

					//System.out.println(in + " belongs to team " + h[in]);

					if(head == null)
					{
						//System.out.println("New head");
						p[h[in]] = head = tail = new Node(in, null);
					}
					else if(p[h[in]] == null)
					{
						//System.out.println("First element of team " + h[in]);
						tail.next = p[h[in]] = new Node(in, null);
						tail = p[h[in]];
					}
					else
					{
						//System.out.println("Adding to back of team " + h[in]);
						Node tmp = new Node(in, p[h[in]].next);
						if(tmp.next == null)
							tail = tmp;
						p[h[in]].next = tmp;
						p[h[in]] = tmp;
						//System.out.println("So the new tail end is " + p[h[in]].n);
					}
				}
				else
				{
					System.out.println(head.n);
					if(head.next != null && h[head.n] == h[head.next.n])
						p[h[head.n]] = head.next;
					else
						p[h[head.n]] = null;

					head = head.next;

					if(head == null)
						tail = null;
				}
			}
			System.out.println();
		}
	}
}


class Node
{
	public int n;
	public Node next;

	public Node(int in, Node inext)
	{
		n = in;
		next = inext;
	}
}

Code: Select all

#include<iostream>
#include<vector>
#include<map>
#include<queue>
#include<string>

using namespace std;

vector<int>q[200005];

int pos[1200];
int no[1000005];
int now;
int t;
int head;


int main()
{
    int i,j,k,l,m,n,u,v;
    int tst=0;
    char str1[200],str2[200],str3[200];
    while(scanf("%d",&t)==1&&t)
    {
        tst++;
        printf("Scenario #%d\n",tst);
        memset(no,0,sizeof(no));
        memset(pos,0,sizeof(no));
        for(i=1;i<=t;i++)
        {
            scanf("%d",&j);
            for(k=1;k<=j;k++)
            {
                scanf("%d",&l);
                no[l]=i;
            }
        }
        now=1;
        head=1;
        while(scanf("%s",&str1)==1)
        {
            if(strcmp(str1,"STOP")==0) break;

            if(strcmp(str1,"ENQUEUE")==0){
                scanf("%d",&n);
                u=no[n];
                v=pos[u];
                if(v==0)
                {
                    v=now++;
                    pos[u]=v;
                    q[v].push_back(n);
                }
                else
                {
                    q[v].push_back(n);
                }

            }
            else if(strcmp(str1,"DEQUEUE")==0){

                if(head<now){
                    u=0;
                    v=q[head][u];
                    printf("%d\n",v);
                    if(q[head].size()!=0){

                        q[head].erase(q[head].begin()+u);
                        if(q[head].size()==0) head++,pos[no[v]]=0;

                    }
                }


            }


        }

        if(head<now)
        for(i=head;i<=now;i++)  q[i].clear();


        printf("\n");
    }

    return 0;
}

Code: Select all

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int main(void)
{
	char str[10];
	int s, t, T, k, K, num, head, tail, X, *queue, *exists;
	const int MAX_NUM = 1000000;
	const int SZ_QUEUE = MAX_NUM * sizeof(int);
	const int SZ_EXISTS = MAX_NUM * sizeof(int);
	
	queue = (int *)malloc(SZ_QUEUE);
	exists = (int *)malloc(SZ_EXISTS);
	
	s = 0;
	while (scanf("%d %*[ \n\r\t]", &T) == 1 && T)
	{
		printf("Scenario #%d\n", ++s);
		
		num = 0;
		memset((void *)exists, 0, SZ_EXISTS);
		for (t = 0; t < T; t++)
		{
			scanf("%d %*[ \n\r\t]", &K);
			for (k = 0; k < K; k++)
			{
				scanf("%d %*[ \n\r\t]", queue + num);
				exists[queue[num]] = 1;
				num++;
			}
		}
		head = 0;
		tail = num - 1;
		
		while (scanf("%[A-Z]", str) == 1 && str[0] != 'S')
		{
			scanf("%*[ \n\r\t]");
			if (str[0] == 'E')
			{
				scanf("%d %*[ \n\r\t]", &X);
				if (!exists[X])
				{
					tail = (tail + 1) % MAX_NUM;
					queue[tail] = X;
					exists[X] = 1;
					num++;
				}
			}
			else if (num)
			{
				exists[queue[head]] = 0;
				printf("%d\n", queue[head]);
				num--;
				if (num) head = (head + 1) % MAX_NUM;
				else { head = 0; tail = -1; }
			}
		}
		scanf("%*[ \n\r\t]");
		
		printf("\n");
	}
	
	return 0;
}

Code: Select all

2
3 1 2 3
3 4 5 6
ENQUEUE 1
ENQUEUE 2
ENQUEUE 4
DEQUEUE
DEQUEUE
ENQUEUE 3
ENQUEUE 1
ENQUEUE 5
ENQUEUE 6
DEQUEUE
DEQUEUE
DEQUEUE
ENQUEUE 1
DEQUEUE
STOP
2
3 1 2 3
3 4 5 6
ENQUEUE 1
ENQUEUE 2
ENQUEUE 4
DEQUEUE
DEQUEUE
DEQUEUE
ENQUEUE 3
ENQUEUE 5
ENQUEUE 6
DEQUEUE
DEQUEUE
DEQUEUE
ENQUEUE 1
DEQUEUE
STOP
2
2 1 2
2 3 4
ENQUEUE 1
ENQUEUE 2
ENQUEUE 3
ENQUEUE 4
DEQUEUE
DEQUEUE
ENQUEUE 1
ENQUEUE 2
DEQUEUE
DEQUEUE
STOP
2
3 101 102 103
3 201 202 203
ENQUEUE 101
ENQUEUE 201
ENQUEUE 102
ENQUEUE 202
ENQUEUE 103
ENQUEUE 203
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
STOP
2
5 259001 259002 259003 259004 259005
6 260001 260002 260003 260004 260005 260006
ENQUEUE 259001
ENQUEUE 260001
ENQUEUE 259002
ENQUEUE 259003
ENQUEUE 259004
ENQUEUE 259005
DEQUEUE
DEQUEUE
ENQUEUE 260002
ENQUEUE 260003
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
STOP
2
2 3 4
1 5
ENQUEUE 3
ENQUEUE 5
ENQUEUE 4
DEQUEUE
DEQUEUE
DEQUEUE
STOP
0

Code: Select all

Scenario #1
1
2
4
5
6
3

Scenario #2
1
2
4
3
5
6
1

Scenario #3
1
2
3
4

Scenario #4
101
102
103
201
202
203

Scenario #5
259001
259002
259003
259004
259005
260001

Scenario #6
3
4
5

Code: Select all

ACCEPTED

Code: Select all

3
3 1 2 3
3 11 12 13
3 21 22 23
ENQUEUE 1
DEQUEUE
ENQUEUE 12
ENQUEUE 2
ENQUEUE 23
ENQUEUE 11
DEQUEUE
ENQUEUE 3
DEQUEUE
DEQUEUE
DEQUEUE
DEQUEUE
STOP
0

Code: Select all

Scenario #1
1
12
11
2
3
23

Code: Select all

Scenario #1
1
12
11
23
0
0