oj.uz

Submission #426493

# Submission time Handle Problem Language Result Execution time Memory
426493 2021-06-14T05:21:51 Z Amylopectin Lightning Rod (NOI18_lightningrod) C++14
66 / 100
 2000 ms 144720 KB 
//#include <iostream>
//#include <stdio.h>
//#include <stdlib.h>
#include <bits/stdc++.h>
using namespace std;
const int mxn = 2e7 + 10;
struct we
{
    int xx,yy;
};
struct we a[mxn] = {};
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int i,j,n,m,ru = -1,cx,cy;
    cin >> n;
//    scanf("%d",&n);
    for(i=0; i<n; i++)
    {
        cin >> cx >> cy;
        if(ru == -1)
        {
            ru ++;
            a[ru] = {cx,cy};
            continue;
        }
//        scanf("%d %d",&cx,&cy);
        while(ru >= 0 && cx - a[ru].xx <= cy - a[ru].yy)
        {
            ru --;
        }
        if(ru == -1 || cx - a[ru].xx > a[ru].yy - cy)
        {
            ru ++;
            a[ru] = {cx,cy};
        }
    }
    cout << ru + 1 << "\n";
//    printf("%d\n",ru + 1);
    return 0;
}

Compilation message

lightningrod.cpp: In function 'int main()':
lightningrod.cpp:17:11: warning: unused variable 'j' [-Wunused-variable]
   17 |     int i,j,n,m,ru = -1,cx,cy;
      |           ^
lightningrod.cpp:17:15: warning: unused variable 'm' [-Wunused-variable]
   17 |     int i,j,n,m,ru = -1,cx,cy;
      |               ^

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1965 ms 144720 KB Output is correct
2 Execution timed out 2009 ms 96428 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 54 ms 3880 KB Output is correct
15 Correct 53 ms 3632 KB Output is correct
16 Correct 55 ms 3600 KB Output is correct

Subtask #6
0 / 10.0

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

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1965 ms 144720 KB Output is correct
2 Execution timed out 2009 ms 96428 KB Time limit exceeded
3 Halted 0 ms 0 KB -