CareerCup

public class LogInfo
{
	public string fun_name;
	public int first_enter_time;
	public int last_exit_time;
	public int fun_remaining_exit_count;
	
	public LogInfo(string name, string time)
	{
		fun_name = name;
		first_enter_time = time;
		fun_remaining_exit_count = 1;
	}
	
	public UpdateLogInfo(string action, int time)
	{
		if(action.Equals("enter"))
		{
			if(fun_remaining_exit_count == 0)
			{
				first_enter_time = time;
			}
			fun_remaining_exit_count++;
		}
		else if(action.Equals("exit"))
		{
			if(fun_remaining_exit_count == 0)
			{
				throw new Exception("Invalid Log Entry");
			}
			last_exit_time = time;
			fun_remaining_exit_count--;
			if(fun_remaining_exit_count == 0)
			{
				PrintLogInfo();
			}
		}
		else
		{
			throw new Exception("Invalid request");
		}
	}
	public void PrintLogInfo()
	{
		if(fun_remaining_exit_count == 0)
		{
			int inclusive_time = last_exit_time - first_enter_time;
			Console.WriteLine("{0}: inclusive time = {1}, exclusive time = {2}"
			,fun_name
			,inclusive_time > 0 ? inclusive_time : inclusive_time == 0 ? 1 : "Invalid" 
			,inclusive_time > 1 ? inclusive_time-1 : inclusive_time == 1 ? 1 :"Invalid")
		}
		else
		{
			throw new Exception("Incomplete data entry");
		}
	}
}

public void printInclusiveAndExclusiveTime (List<Log> logs)
{
	var logMap = new Dictionary<string,LogInfo>();
	foreach(var log in logs)
	{
		if(logMap.ContainsKey(log.fun_name))
		{
			logMap[fun_name].UpdateLogInfo(log.enterorExit, log.time);
		}
		else if(log.enterorExit.Equals("enter"))
		{
			logMap.Add(fun_name, new LogInfo(fun_name, log.time));
		}
		else
		{
			throw new Exception("Invalid Log Entry");
		}
	}
}

Complexity : O(N) + O(K), where N is the size of Logs, and K is the distinct entries of the log function names.