Official Analysis (Java)

Video Solution

By Varun Ragunath

Video Solution Code

Since the time the cows arrive and need for questioning can be up to 10610^6, we should traverse through the times as steps.

Implementation

Time Complexity: O(Nlog⁡N)\mathcal{O}(N \log N)

C++

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>


using namespace std;


int main() {
	freopen("cowqueue.in", "r", stdin);
	int n;

Java

import java.io.*;
import java.util.*;


class CowQueue {
 	Code Snippet: Cow Class (Click to expand)


	public static void main(String[] args) throws IOException {
		BufferedReader read = new BufferedReader(new FileReader("cowqueue.in"));
		int n = Integer.parseInt(read.readLine());

Python

import sys


sys.stdin = open("cowqueue.in")


n = int(input())


cows = []
for i in range(n):
	cows.append(list(map(int, input().split())))

Join the USACO Forum!

Stuck on a problem, or don't understand a module? Join the USACO Forum and get help from other competitive programmers!

Join Forum