oj.uz

답안 #282437

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
282437 2020-08-24T12:26:37 Z MKopchev Long Mansion (JOI17_long_mansion) C++14
10 / 100
 3000 ms 7048 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_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:59:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   59 |     scanf("%i",&q);
      |     ~~~~~^~~~~~~~~
long_mansion.cpp:64:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   64 |         scanf("%i%i",&le,&ri);
      |         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 2816 KB Output is correct
2 Correct 33 ms 2936 KB Output is correct
3 Correct 155 ms 2936 KB Output is correct
4 Correct 6 ms 2816 KB Output is correct
5 Correct 37 ms 2816 KB Output is correct
6 Correct 12 ms 2816 KB Output is correct
7 Correct 9 ms 2944 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 2816 KB Output is correct
2 Correct 33 ms 2936 KB Output is correct
3 Correct 155 ms 2936 KB Output is correct
4 Correct 6 ms 2816 KB Output is correct
5 Correct 37 ms 2816 KB Output is correct
6 Correct 12 ms 2816 KB Output is correct
7 Correct 9 ms 2944 KB Output is correct
8 Correct 155 ms 5628 KB Output is correct
9 Correct 152 ms 5672 KB Output is correct
10 Correct 182 ms 5880 KB Output is correct
11 Correct 300 ms 6136 KB Output is correct
12 Correct 144 ms 5880 KB Output is correct
13 Correct 148 ms 5972 KB Output is correct
14 Correct 148 ms 5880 KB Output is correct
15 Correct 157 ms 6008 KB Output is correct
16 Correct 166 ms 6264 KB Output is correct
17 Correct 155 ms 5880 KB Output is correct
18 Correct 150 ms 6008 KB Output is correct
19 Correct 149 ms 5920 KB Output is correct
20 Correct 170 ms 6008 KB Output is correct
21 Correct 177 ms 6136 KB Output is correct
22 Correct 155 ms 5880 KB Output is correct
23 Correct 156 ms 5852 KB Output is correct
24 Correct 151 ms 5752 KB Output is correct
25 Correct 153 ms 5752 KB Output is correct
26 Correct 158 ms 5700 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3080 ms 7048 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 2816 KB Output is correct
2 Correct 33 ms 2936 KB Output is correct
3 Correct 155 ms 2936 KB Output is correct
4 Correct 6 ms 2816 KB Output is correct
5 Correct 37 ms 2816 KB Output is correct
6 Correct 12 ms 2816 KB Output is correct
7 Correct 9 ms 2944 KB Output is correct
8 Correct 155 ms 5628 KB Output is correct
9 Correct 152 ms 5672 KB Output is correct
10 Correct 182 ms 5880 KB Output is correct
11 Correct 300 ms 6136 KB Output is correct
12 Correct 144 ms 5880 KB Output is correct
13 Correct 148 ms 5972 KB Output is correct
14 Correct 148 ms 5880 KB Output is correct
15 Correct 157 ms 6008 KB Output is correct
16 Correct 166 ms 6264 KB Output is correct
17 Correct 155 ms 5880 KB Output is correct
18 Correct 150 ms 6008 KB Output is correct
19 Correct 149 ms 5920 KB Output is correct
20 Correct 170 ms 6008 KB Output is correct
21 Correct 177 ms 6136 KB Output is correct
22 Correct 155 ms 5880 KB Output is correct
23 Correct 156 ms 5852 KB Output is correct
24 Correct 151 ms 5752 KB Output is correct
25 Correct 153 ms 5752 KB Output is correct
26 Correct 158 ms 5700 KB Output is correct
27 Execution timed out 3080 ms 7048 KB Time limit exceeded
28 Halted 0 ms 0 KB -