oj.uz

Submission #331999

# Submission time Handle Problem Language Result Execution time Memory
331999 2020-12-01T05:22:43 Z anishrajeev Temperature (POI11_tem) Java 11
0 / 100
 1000 ms 56028 KB 
import java.io.*;
import java.util.*;

public class tem {
    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        //BufferedReader bf = new BufferedReader(new FileReader("tester.in"));
        PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
        int[] min = new int[1000000];
        int[] max = new int[1000000];
        int N = Integer.parseInt(bf.readLine());
        for(int i = 0; i < N; i++){
            StringTokenizer stk = new StringTokenizer(bf.readLine());
            min[i] = Integer.parseInt(stk.nextToken());
            max[i] = Integer.parseInt(stk.nextToken());
        }
        TreeSet<Integer> set = new TreeSet<>();
        HashMap<Integer, Integer> map = new HashMap<>();
        int right = 0;
        int left = 0;
        int answer = 0;
        set.add(min[0]);
        map.put(min[0], 1);
        int counter = 1;
        while(right < N){
            int highestmin = -1;
            if(set.size()!=0)highestmin = set.last();
            if(min[right+1]>=highestmin||highestmin<=max[right+1]){
                right++;
                if(set.contains(min[right]))map.replace(min[right], map.get(min[right])+1);
                else{
                    set.add(min[right]);
                    map.put(min[right], 1);
                }
                counter++;
            }
            else{
                left++;
                map.replace(min[left-1], map.get(min[left-1])-1);
                if(map.get(min[left-1])==0){
                    map.remove(min[left-1]);
                    set.remove(min[left-1]);
                }
                counter--;
            }
            answer = Math.max(answer, counter);
        }
        System.out.println(answer);
    }
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 87 ms 17896 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 95 ms 17600 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 344 ms 21972 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #4
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 394 ms 26208 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 554 ms 35112 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 563 ms 39868 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 593 ms 25728 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1087 ms 56028 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 863 ms 33656 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 474 ms 29444 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #11
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 527 ms 39504 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #12
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 527 ms 37504 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -