oj.uz

Submission #850255

# Submission time Handle Problem Language Result Execution time Memory
850255 2023-09-16T08:22:15 Z alexdd Amusement Park (JOI17_amusement_park) C++17
28 / 100
 30 ms 7528 KB 
#include "Joi.h"
#include<bits/stdc++.h>
using namespace std;
static bool visited[10005];
static vector<int> ord;
static vector<int> con[10005];
static bool done[10005];
static void dfs(int nod)
{
    visited[nod]=1;
    sort(con[nod].begin(),con[nod].end());
    ord.push_back(nod);
    for(auto adj:con[nod])
    {
        if(!visited[adj])
        {
            dfs(adj);
            ord.push_back(nod);
        }
    }
}
void Joi(int N, int M, int A[], int B[], long long X, int T)
{
    ord.clear();
    for(int i=0;i<N;i++)
    {
        visited[i]=0;
        con[i].clear();
        done[i]=0;
    }

    for(int i=0;i<M;i++)
    {
        con[A[i]].push_back(B[i]);
        con[B[i]].push_back(A[i]);
    }
    dfs(0);
    int cnt=0;
    for(int i=0;i<(int)ord.size();i++)
    {
        if(!done[ord[i]])
        {
            if(((1LL<<cnt)&X))
                MessageBoard(ord[i],1);
            else
                MessageBoard(ord[i],0);
            cnt=(cnt+1)%60;
            done[ord[i]]=1;
        }
    }
}



#include "Ioi.h"
#include<bits/stdc++.h>
using namespace std;
static bool visited[10005];
static vector<int> ord;
static vector<int> con[10005];
static bool done[10005];
static int p[50005];
static int poz[10005];
static int fr[65];
static int frst[65];
static int frdr[65];
static int care[10005];
static map<pair<int,int>,int> mp;
static void dfs(int nod)
{
    visited[nod]=1;
    sort(con[nod].begin(),con[nod].end());
    poz[nod]=ord.size();
    ord.push_back(nod);
    for(auto adj:con[nod])
    {
        if(!visited[adj])
        {
            dfs(adj);
            ord.push_back(nod);
        }
    }
}
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T)
{
    ord.clear();
    for(int i=0;i<N;i++)
    {
        visited[i]=0;
        con[i].clear();
        done[i]=0;
    }
    for(int i=0;i<60;i++)
    {
        fr[i]=0;
        frst[i]=0;
        frdr[i]=0;
    }

    for(int i=0;i<M;i++)
    {
        con[A[i]].push_back(B[i]);
        con[B[i]].push_back(A[i]);
        mp[{A[i],B[i]}]++;
        mp[{B[i],A[i]}]++;
    }
    dfs(0);
    int cnt=0;
    for(int i=0;i<(int)ord.size();i++)
    {
        if(!done[ord[i]])
        {
            care[ord[i]]=cnt;
            cnt=(cnt+1)%60;
            done[ord[i]]=1;
        }
        p[i]=care[ord[i]];
    }
    int cntst=0,cntdr=0,pozst,pozdr;
    for(int i=poz[P];i<(int)ord.size();i++)
    {
        if(frdr[p[i]]==0)
        {
            frdr[p[i]]=1;
            cntdr++;
            if(cntdr==60)
            {
                pozdr=i-poz[P];
                break;
            }
        }
    }
    for(int i=poz[P];i>=0;i--)
    {
        if(frst[p[i]]==0)
        {
            frst[p[i]]=1;
            cntst++;
            if(cntst==60)
            {
                pozst=poz[P]-i;
                break;
            }
        }
    }
    long long rez=0;
    int cate=0;
    if((cntdr==60 && cntst<60) || (cntdr==60 && cntst==60 && pozdr<pozst) || (cntdr<60 && cntst<60 && poz[P]>ord.size()-poz[P]))
    {
        for(int i=poz[P];i<(int)ord.size();i++)
        {
            if(fr[p[i]]==0)
            {
                if(V==1) rez += (1LL<<(p[i]));
                fr[p[i]]=1;
                cate++;
                if(cate==60)
                    return rez;
            }
            if(i+1<(int)ord.size()) V = Move(ord[i+1]);
        }
        for(int i=(int)ord.size()-1;i>=0;i--)
        {
            if(fr[p[i]]==0)
            {
                if(V==1) rez += (1LL<<(p[i]));
                fr[p[i]]=1;
                cate++;
                if(cate==60)
                    return rez;
            }
            V = Move(ord[i-1]);
        }
    }
    else
    {
        for(int i=poz[P];i>=0;i--)
        {
            if(fr[p[i]]==0)
            {
                if(V==1) rez += (1LL<<(p[i]));
                fr[p[i]]=1;
                cate++;
                if(cate==60)
                    return rez;
            }
            if(i-1>=0) V = Move(ord[i-1]);
        }
        for(int i=0;i<(int)ord.size();i++)
        {
            if(fr[p[i]]==0)
            {
                if(V==1) rez += (1LL<<(p[i]));
                fr[p[i]]=1;
                cate++;
                if(cate==60)
                    return rez;
            }
            V = Move(ord[i+1]);
        }
    }
    return rez;
}

Compilation message

Ioi.cpp: In function 'long long int Ioi(int, int, int*, int*, int, int, int)':
Ioi.cpp:94:109: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |     if((cntdr==60 && cntst<60) || (cntdr==60 && cntst==60 && pozdr<pozst) || (cntdr<60 && cntst<60 && poz[P]>ord.size()-poz[P]))
      |                                                                                                       ~~~~~~^~~~~~~~~~~~~~~~~~
Ioi.cpp:94:59: warning: 'pozst' may be used uninitialized in this function [-Wmaybe-uninitialized]
   94 |     if((cntdr==60 && cntst<60) || (cntdr==60 && cntst==60 && pozdr<pozst) || (cntdr<60 && cntst<60 && poz[P]>ord.size()-poz[P]))
      |                                   ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
Ioi.cpp:94:59: warning: 'pozdr' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1304 KB Output is correct
2 Correct 1 ms 1292 KB Output is correct
3 Correct 2 ms 1304 KB Output is correct
4 Correct 1 ms 1296 KB Output is correct
5 Correct 2 ms 1320 KB Output is correct
6 Correct 0 ms 1308 KB Output is correct
7 Correct 2 ms 1316 KB Output is correct
8 Correct 2 ms 1312 KB Output is correct
9 Correct 1 ms 1556 KB Output is correct
10 Correct 1 ms 1292 KB Output is correct
11 Correct 5 ms 2116 KB Output is correct
12 Correct 1 ms 1308 KB Output is correct
13 Correct 2 ms 1312 KB Output is correct
14 Correct 1 ms 1304 KB Output is correct
15 Correct 1 ms 1308 KB Output is correct
16 Correct 1 ms 1312 KB Output is correct
17 Correct 2 ms 1296 KB Output is correct
18 Correct 0 ms 1300 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 7372 KB Output is correct
2 Correct 27 ms 7288 KB Output is correct
3 Correct 27 ms 7168 KB Output is correct
4 Correct 16 ms 4576 KB Output is correct
5 Correct 16 ms 5088 KB Output is correct
6 Correct 16 ms 4832 KB Output is correct
7 Correct 16 ms 4844 KB Output is correct
8 Correct 15 ms 4836 KB Output is correct
9 Correct 15 ms 5016 KB Output is correct
10 Correct 13 ms 4584 KB Output is correct
11 Correct 15 ms 4588 KB Output is correct
12 Correct 13 ms 4712 KB Output is correct
13 Correct 13 ms 4324 KB Output is correct
14 Correct 13 ms 4316 KB Output is correct
15 Correct 13 ms 4576 KB Output is correct
16 Correct 15 ms 4576 KB Output is correct
17 Correct 15 ms 4524 KB Output is correct
18 Correct 16 ms 4576 KB Output is correct
19 Correct 16 ms 4576 KB Output is correct
20 Correct 11 ms 5100 KB Output is correct
21 Correct 10 ms 5092 KB Output is correct
22 Correct 16 ms 4836 KB Output is correct
23 Correct 16 ms 4844 KB Output is correct
24 Correct 16 ms 4832 KB Output is correct
25 Correct 16 ms 4840 KB Output is correct
26 Correct 16 ms 4904 KB Output is correct
27 Correct 16 ms 4844 KB Output is correct
28 Correct 16 ms 5076 KB Output is correct
29 Correct 13 ms 4568 KB Output is correct
30 Correct 15 ms 4704 KB Output is correct
31 Correct 1 ms 1296 KB Output is correct
32 Correct 2 ms 1296 KB Output is correct
33 Correct 2 ms 1312 KB Output is correct
34 Correct 0 ms 1292 KB Output is correct
35 Correct 2 ms 1300 KB Output is correct
36 Correct 0 ms 1292 KB Output is correct
37 Correct 1 ms 1296 KB Output is correct
38 Correct 1 ms 1308 KB Output is correct
39 Correct 1 ms 1304 KB Output is correct
40 Correct 1 ms 1308 KB Output is correct
41 Correct 0 ms 1372 KB Output is correct
42 Correct 0 ms 1296 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1296 KB Output is correct
2 Correct 0 ms 1308 KB Output is correct
3 Correct 1 ms 1304 KB Output is correct
4 Correct 2 ms 2092 KB Output is correct
5 Correct 3 ms 2092 KB Output is correct
6 Correct 3 ms 2100 KB Output is correct
7 Correct 2 ms 2108 KB Output is correct
8 Correct 2 ms 2096 KB Output is correct
9 Correct 11 ms 5872 KB Output is correct
10 Correct 11 ms 5788 KB Output is correct
11 Correct 11 ms 5868 KB Output is correct
12 Correct 1 ms 1296 KB Output is correct
13 Correct 0 ms 1296 KB Output is correct
14 Correct 1 ms 1560 KB Output is correct
15 Correct 0 ms 1296 KB Output is correct

Subtask #4
0.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 7392 KB Output is correct
2 Correct 28 ms 7424 KB Output is correct
3 Partially correct 27 ms 7528 KB Partially correct
4 Correct 16 ms 4576 KB Output is correct
5 Correct 15 ms 5452 KB Output is correct
6 Correct 16 ms 5016 KB Output is correct
7 Correct 18 ms 4836 KB Output is correct
8 Correct 15 ms 4800 KB Output is correct
9 Correct 16 ms 4836 KB Output is correct
10 Correct 16 ms 4844 KB Output is correct
11 Correct 15 ms 4584 KB Output is correct
12 Correct 13 ms 4316 KB Output is correct
13 Correct 13 ms 4212 KB Output is correct
14 Correct 13 ms 4328 KB Output is correct
15 Correct 15 ms 4536 KB Output is correct
16 Correct 13 ms 4428 KB Output is correct
17 Correct 15 ms 4512 KB Output is correct
18 Correct 15 ms 4584 KB Output is correct
19 Correct 16 ms 4580 KB Output is correct
20 Incorrect 11 ms 5092 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 7420 KB Output is correct
2 Incorrect 27 ms 7420 KB Output isn't correct
3 Halted 0 ms 0 KB -