oj.uz

Submission #77240

# Submission time Handle Problem Language Result Execution time Memory
77240 2018-09-24T08:01:37 Z farukkastamonuda Temperature (POI11_tem) C++14
100 / 100
 353 ms 32320 KB 
#include <bits/stdc++.h>
using namespace std;
 
int n, s[1000000], e[1000000], x[1000000], v[1000000], mn, c[1000000], ans, ds, de;
 
int main(){
    scanf("%d", &n);
    for(int i = 0; i < n; i++){
        scanf("%d%d", s + i, e + i);
    }
    ds = de = n;
    for(int i = 0;i < n;i++){
        int cmn = i;
        while(ds < de && s[x[ds]] < s[i]){
            cmn = min(cmn, v[x[ds]]);
            c[v[x[ds]]] = 0;
            ds++;
        }
        c[cmn] = 1;
        while(ds < de && s[x[de - 1]] > e[i]){
            de--;
            c[v[x[de]]] = 0;
            while(!c[mn]) mn++;
        }
        x[--ds] = i;
        v[i] = cmn;
        ans = max(ans, i - mn + 1);
    }
    printf("%d\n", ans);
}

Compilation message

tem.cpp: In function 'int main()':
tem.cpp:7:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
tem.cpp:9:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", s + i, e + i);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 424 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 516 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 688 KB Output is correct
2 Correct 5 ms 880 KB Output is correct
3 Correct 8 ms 936 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 8104 KB Output is correct
2 Correct 111 ms 9068 KB Output is correct
3 Correct 124 ms 10916 KB Output is correct

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 12464 KB Output is correct
2 Correct 260 ms 14888 KB Output is correct
3 Correct 226 ms 16064 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 16064 KB Output is correct
2 Correct 258 ms 16064 KB Output is correct
3 Correct 300 ms 16932 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 314 ms 17572 KB Output is correct
2 Correct 264 ms 19220 KB Output is correct
3 Correct 344 ms 23620 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 322 ms 23620 KB Output is correct
2 Correct 211 ms 23620 KB Output is correct
3 Correct 246 ms 23620 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 23620 KB Output is correct
2 Correct 185 ms 23620 KB Output is correct
3 Correct 193 ms 23620 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 177 ms 23620 KB Output is correct
2 Correct 182 ms 26872 KB Output is correct

Subtask #11
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 283 ms 26872 KB Output is correct
2 Correct 353 ms 32320 KB Output is correct

Subtask #12
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 281 ms 32320 KB Output is correct
2 Correct 325 ms 32320 KB Output is correct