oj.uz

Submission #426282

# Submission time Handle Problem Language Result Execution time Memory
426282 2021-06-13T16:40:05 Z Amylopectin Lightning Rod (NOI18_lightningrod) C++14
80 / 100
 2000 ms 77412 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;
//        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
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1885 ms 77412 KB Output is correct
2 Correct 1859 ms 76168 KB Output is correct
3 Correct 1847 ms 74228 KB Output is correct

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 204 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 204 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 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 320 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 204 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 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 360 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 204 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 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 360 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 45 ms 1476 KB Output is correct
15 Correct 48 ms 1488 KB Output is correct
16 Correct 44 ms 2244 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1870 ms 49716 KB Output is correct
2 Correct 1865 ms 49136 KB Output is correct
3 Correct 1815 ms 48008 KB Output is correct

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1885 ms 77412 KB Output is correct
2 Correct 1859 ms 76168 KB Output is correct
3 Correct 1847 ms 74228 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 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 360 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 45 ms 1476 KB Output is correct
18 Correct 48 ms 1488 KB Output is correct
19 Correct 44 ms 2244 KB Output is correct
20 Correct 1870 ms 49716 KB Output is correct
21 Correct 1865 ms 49136 KB Output is correct
22 Correct 1815 ms 48008 KB Output is correct
23 Execution timed out 2078 ms 452 KB Time limit exceeded
24 Halted 0 ms 0 KB -