OJ Board

Donovan Barker from Danbury was looking for 100 college essay topics rhodesian ridgeback Kody Olson found the answer to a search query 100 college essay topics rhodesian ridgeback 100 college essay topics rhodesian ridgeback http://essayerudite.com/images/banner/500x500.jpg professional rhetorical a...

i am stil getting WA even after considering graph as disconnected here is my code #include <iostream> #include <stdlib.h> #include <algorithm> #include <string.h> #include <sstream> #include <map> #include <vector> #define max 110 using namespace std; map<string,int> mp; vector<int> adj[max]; int di...

Is there anyone could help me? I passed all the test case in this discussion thread but still get WA.
I used "map" to achieve alphabetical order and cin.peek() to know whether to cout endl or not.

Ok I got rid of those loops, and used another array which keeps track of how many time dfs has been called from a node. If dfs has been called more than 1 time from a source node, then the node is an articulation point. Found some other errors that were causing TLE and fixed them. Now getting WA. co...

Trying to determine if the source node is an articulation point or not. If the finishing time of the first adjacent node of the source node is less than the discovery time of any of the the next adjacent nodes, it is an articulation point. Don't know how I can achieve this faster in this way, have t...

What are you trying to do on lines 75-77? Can you think of a faster way?

I'm using DFS to find articulation points, but getting TLE. Please help! #include <bits/stdc++.h> #define MAX 101 using namespace std; map<string, int> mymap; vector<int> adj[MAX]; vector<int> apoints; int col[MAX], par[MAX], low[MAX], dis[MAX], fin[MAX], tim, n; void dfs(); void dfs_visit(int); int...

Don't print a blank line at the start of the output.

edit: I have changed output how you wrote, but validator still return WA import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintStream; //import java.util.Scanner; import java.util.Arrays; //City map #1: 1 camera(s) found public class Main { ...

You should print a blank line between output sets. Don't print an extra blank line at the end.

Hello, I am problem with submittion of my code - WA. I have tried all of IO what has been written here and my program returned correct answer. Could anyone help me? It could be kind of confusing, because name of method, etc... is written in Czech import java.io.BufferedReader; import java.io.IOExcep...

Got WA !!!! Would anyone please give me some sample input ??? for those who are getting WA !!! output must be 0.....

Hi All, My code has correctly solved all the inputs posted here, but it is still getting WA. It locates all the articulation points in the graph associated to a city, which will later correspond to camera locations. First, it performs a DFS computing the "low" parameter. Then, the articula...

Your code is printing an extra '\n' after the last case..

Remove you code after AC