8888  -->  16

Edited by author 08.01.2015 10:09

Edited by author 08.01.2015 10:09

n = 0 ?
Может такое быть ?

I'm repeatedly getting WA in Test#3.
I converted all weights to negative and used Bellman-Ford. I also checked if the destination is reachable from the source. Nevertheless, I'm getting WA in the same test case. Could someone give me test case #3?

I got WA#1 :(
What's wrong bros?

===============================================================
static int speakerCount = 0;

    static void solve() throws IOException {
        final int N = nextInt();

        // graph[i][j] = true: i-th is parent of j-th
        final boolean[][] graph = new boolean[N + 1][N + 1];

        for (int line = 1; line <= N; line++) {
            int parent = nextInt();

            if (parent == 0) {
                continue;
            }

            int child = nextInt();
            while (0 < child) {
                graph[parent][child] = true;

                child = nextInt();
            }
        }

        StringBuilder speakerList = new StringBuilder();
        final boolean[] visitedNodes = new boolean[N + 1];

        while (speakerCount < N) {
            for (int node = 1; node <= N; node++) {
                if (!visitedNodes[node]) {
                    visit(node, visitedNodes, speakerList, graph);

                    break;
                }
            }
        }

        out.println(speakerList.toString().trim());
    }

    private static void visit(int node, boolean[] visitedNodes,
            StringBuilder speakerList, boolean[][] graph) {

        // Stop if marked
        if (visitedNodes[node]) {
            return;
        }

        // Marked
        visitedNodes[node] = true;

        // Visit each child
        for (int child = 1; child < visitedNodes.length; child++) {
            if (graph[node][child]) {
                visit(child, visitedNodes, speakerList, graph);
            }
        }

        speakerList.insert(0, node + " ");
        speakerCount++;
    }

Edited by author 23.05.2014 15:48

Contains empty sequence.

can anyone help me with that?

My code:

[code deleted]

Edited by moderator 20.06.2020 16:24

What is the 11th test about?
Two my solutions (on pascal and c++) got wa11 and I really don't know why.

My code got WA for #27. After checking forever for errors, I edited my comparison for my set so that if two distances are equal, the distance with the bigger key will come first as a last desperation. After submitting this, I got AC.
I think this should be stated in the problem statement, because it affects the solutions.
For those that don't understand what I'm talking about:

Input:
2
1 1
1 1
1
1
(Before) WA 27
Output:
1
(After) AC
Output:
2

del

Edited by author 06.01.2015 21:37

Ridiculous! It's O(damn E)! AND I got rid of all the lists and used simple arrays instead. It just cannot get any faster than that...

aaabbbababbaaaa
ans:
111111111111001

Edited by author 04.01.2015 22:13

Edited by author 04.01.2015 22:15

Edited by author 08.06.2009 19:23

Di and Do may _COINCIDE_.

Could someone please explain me what does phrase "Rocks of pairwise different colors" mean? I assume that in second example the only possible set of Rocks is "ababa", but I can see there 6 pairs of Rocks with different colors. The only possible match to the samples I can see is if you could pick a set of Rocks with at most k different colors, but I don't think it is the right meaning of the statement.

Update: Yep, my last guess was correct after all.

Edited by author 25.12.2014 00:30

Precision????? or something special???

#include<stdio.h>
#include <string.h>
// n is not required at all, i am leaving it.
int main(){

int n, ce, cm, cl, max = 0;
char c;
scanf ("%d", &n);

while ((c = getchar())!= EOF){
    if (c == 'E') ce++;
    else if (c == 'M') cm++;
    else if (c == 'L') cl++;
}
/*
Emperor Penguin
Macaroni Penguin
Little Penguin
*/

max = (ce > cm) ? ((ce > cl) ? ce : cl) : ((cm > cl) ? cm : cl);
if (max == ce) printf("Emperor Penguin");
else if (max == cm) printf ("Macaroni Penguin");
else printf ("Little Penguin");


return 0;
}

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

int main()
{
    int sel[10010],n,m,tmp,i;
    scanf("%d%d",&n,&m);

    memset(sel,0,10010*sizeof(int));

    for(i=0; i<m; i++) {
        scanf("%d",&tmp);
        sel[tmp]++;
    }

    for(i=1; i<=n; i++)
        printf("%.2f%\n",((double)sel[i]*(double)100)/(double)m);

    return 0;
}

whats wrong?

6 6
4 2
1 2
4 5
2 3
2 6
6 4
1 5
answer : 0

Edited by author 07.01.2014 01:25