oj.uz

답안 #282443

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
282443 2020-08-24T12:29:05 Z MKopchev Long Mansion (JOI17_long_mansion) C++14
25 / 100
 271 ms 15096 KB 
#include<bits/stdc++.h>
using namespace std;

const int nmax=1e5+42;

int n,inp[nmax];

vector<int> seen[nmax];

int can_l[nmax],can_r[nmax];

bool test(int val,int l,int r)
{
    if(seen[val].size()==0)return 0;

    int p=lower_bound(seen[val].begin(),seen[val].end(),l)-seen[val].begin();

    if(p<seen[val].size()&&seen[val][p]<=r)return 1;

    return 0;
}
int main()
{
    scanf("%i",&n);

    for(int i=1;i<n;i++)scanf("%i",&inp[i]);

    for(int i=1;i<=n;i++)
    {
        int sz,val;
        scanf("%i",&sz);

        for(int j=1;j<=sz;j++)
        {
            scanf("%i",&val);
            seen[val].push_back(i);
        }
    }

    for(int i=1;i<=n;i++)
    {
        can_l[i]=i;
        can_r[i]=i;

        while(can_l[i]!=1||can_r[i]!=n)
        {
            if(can_l[i]!=1&&test(inp[can_l[i]-1],can_l[i],can_r[i]))
            {
                can_l[i]--;

                can_r[i]=max(can_r[i],can_r[can_l[i]]);

                can_l[i]=min(can_l[i],can_l[can_l[i]]);
            }
            else if(can_r[i]!=n&&test(inp[can_r[i]],can_l[i],can_r[i]))can_r[i]++;
            else break;
        }
    }

    int q;
    scanf("%i",&q);

    for(int i=1;i<=q;i++)
    {
        int le,ri;
        scanf("%i%i",&le,&ri);

        if(can_l[le]<=ri&&ri<=can_r[le])printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}

Compilation message

long_mansion.cpp: In function 'bool test(int, int, int)':
long_mansion.cpp:18:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     if(p<seen[val].size()&&seen[val][p]<=r)return 1;
      |        ~^~~~~~~~~~~~~~~~~
long_mansion.cpp: In function 'int main()':
long_mansion.cpp:24:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   24 |     scanf("%i",&n);
      |     ~~~~~^~~~~~~~~
long_mansion.cpp:26:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   26 |     for(int i=1;i<n;i++)scanf("%i",&inp[i]);
      |                         ~~~~~^~~~~~~~~~~~~~
long_mansion.cpp:31:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   31 |         scanf("%i",&sz);
      |         ~~~~~^~~~~~~~~~
long_mansion.cpp:35:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   35 |             scanf("%i",&val);
      |             ~~~~~^~~~~~~~~~~
long_mansion.cpp:61:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   61 |     scanf("%i",&q);
      |     ~~~~~^~~~~~~~~
long_mansion.cpp:66:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   66 |         scanf("%i%i",&le,&ri);
      |         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2816 KB Output is correct
2 Correct 5 ms 2816 KB Output is correct
3 Correct 7 ms 2816 KB Output is correct
4 Correct 5 ms 2816 KB Output is correct
5 Correct 4 ms 2816 KB Output is correct
6 Correct 5 ms 2816 KB Output is correct
7 Correct 5 ms 2816 KB Output is correct
8 Correct 168 ms 5152 KB Output is correct
9 Correct 156 ms 5112 KB Output is correct
10 Correct 154 ms 5400 KB Output is correct
11 Correct 158 ms 5368 KB Output is correct
12 Correct 145 ms 5368 KB Output is correct
13 Correct 139 ms 5368 KB Output is correct
14 Correct 146 ms 5496 KB Output is correct
15 Correct 142 ms 5368 KB Output is correct
16 Correct 135 ms 5624 KB Output is correct
17 Correct 142 ms 5320 KB Output is correct
18 Correct 143 ms 5368 KB Output is correct
19 Correct 144 ms 5392 KB Output is correct
20 Correct 138 ms 5496 KB Output is correct
21 Correct 134 ms 5624 KB Output is correct
22 Correct 138 ms 5368 KB Output is correct
23 Correct 146 ms 5368 KB Output is correct
24 Correct 143 ms 5368 KB Output is correct
25 Correct 143 ms 5240 KB Output is correct
26 Correct 144 ms 5240 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 267 ms 14200 KB Output is correct
2 Correct 268 ms 14840 KB Output is correct
3 Correct 258 ms 14624 KB Output is correct
4 Correct 271 ms 15096 KB Output is correct
5 Correct 268 ms 14972 KB Output is correct
6 Correct 242 ms 13304 KB Output is correct
7 Correct 206 ms 13176 KB Output is correct
8 Correct 210 ms 13048 KB Output is correct
9 Correct 209 ms 13180 KB Output is correct
10 Correct 204 ms 13140 KB Output is correct
11 Correct 215 ms 13048 KB Output is correct

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2816 KB Output is correct
2 Correct 5 ms 2816 KB Output is correct
3 Correct 7 ms 2816 KB Output is correct
4 Correct 5 ms 2816 KB Output is correct
5 Correct 4 ms 2816 KB Output is correct
6 Correct 5 ms 2816 KB Output is correct
7 Correct 5 ms 2816 KB Output is correct
8 Correct 168 ms 5152 KB Output is correct
9 Correct 156 ms 5112 KB Output is correct
10 Correct 154 ms 5400 KB Output is correct
11 Correct 158 ms 5368 KB Output is correct
12 Correct 145 ms 5368 KB Output is correct
13 Correct 139 ms 5368 KB Output is correct
14 Correct 146 ms 5496 KB Output is correct
15 Correct 142 ms 5368 KB Output is correct
16 Correct 135 ms 5624 KB Output is correct
17 Correct 142 ms 5320 KB Output is correct
18 Correct 143 ms 5368 KB Output is correct
19 Correct 144 ms 5392 KB Output is correct
20 Correct 138 ms 5496 KB Output is correct
21 Correct 134 ms 5624 KB Output is correct
22 Correct 138 ms 5368 KB Output is correct
23 Correct 146 ms 5368 KB Output is correct
24 Correct 143 ms 5368 KB Output is correct
25 Correct 143 ms 5240 KB Output is correct
26 Correct 144 ms 5240 KB Output is correct
27 Correct 267 ms 14200 KB Output is correct
28 Correct 268 ms 14840 KB Output is correct
29 Correct 258 ms 14624 KB Output is correct
30 Correct 271 ms 15096 KB Output is correct
31 Correct 268 ms 14972 KB Output is correct
32 Correct 242 ms 13304 KB Output is correct
33 Correct 206 ms 13176 KB Output is correct
34 Correct 210 ms 13048 KB Output is correct
35 Correct 209 ms 13180 KB Output is correct
36 Correct 204 ms 13140 KB Output is correct
37 Correct 215 ms 13048 KB Output is correct
38 Incorrect 77 ms 7544 KB Output isn't correct
39 Halted 0 ms 0 KB -