oj.uz

답안 #710124

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
710124 2023-03-15T04:56:09 Z ToroTN Lightning Rod (NOI18_lightningrod) C++14
80 / 100
 2000 ms 262144 KB 
#include<bits/stdc++.h>
using namespace std;
#define X first
#define Y second
int n,x[10000005],y[10000005],hsh[10000005],ans=0;
stack<pair<int,int> > stk;
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%d%d",&x[i],&y[i]);
    for(int i=1;i<=n;i++)
    {
        while(!stk.empty())
        {
            if(y[i]-x[i]>=stk.top().X)
            {
                stk.pop();
            }else
            {
                break;
            }
        }
        stk.push({y[i]-x[i],i});
    }
    while(!stk.empty())
    {
        ++hsh[stk.top().Y];
        stk.pop();
    }
    for(int i=n;i>=1;i--)
    {
        while(!stk.empty())
        {
            if(y[i]+x[i]>=stk.top().X)
            {
                stk.pop();
            }else
            {
                break;
            }
        }
        stk.push({y[i]+x[i],i});
    }
    while(!stk.empty())
    {
        ++hsh[stk.top().Y];
        if(hsh[stk.top().Y]==2)++ans;
        stk.pop();
    }
    printf("%d\n",ans);
}

Compilation message

lightningrod.cpp: In function 'int main()':
lightningrod.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
lightningrod.cpp:10:31: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     for(int i=1;i<=n;i++)scanf("%d%d",&x[i],&y[i]);
      |                          ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1794 ms 237824 KB Output is correct
2 Correct 1885 ms 262144 KB Output is correct
3 Correct 1988 ms 262144 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 47 ms 2444 KB Output is correct
15 Correct 52 ms 2588 KB Output is correct
16 Correct 60 ms 3272 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1950 ms 191368 KB Output is correct
2 Correct 1825 ms 191096 KB Output is correct
3 Correct 1975 ms 262144 KB Output is correct

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1794 ms 237824 KB Output is correct
2 Correct 1885 ms 262144 KB Output is correct
3 Correct 1988 ms 262144 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 47 ms 2444 KB Output is correct
18 Correct 52 ms 2588 KB Output is correct
19 Correct 60 ms 3272 KB Output is correct
20 Correct 1950 ms 191368 KB Output is correct
21 Correct 1825 ms 191096 KB Output is correct
22 Correct 1975 ms 262144 KB Output is correct
23 Execution timed out 2041 ms 259880 KB Time limit exceeded
24 Halted 0 ms 0 KB -