oj.uz

Submission #521446

# Submission time Handle Problem Language Result Execution time Memory
521446 2022-02-02T06:51:06 Z azberjibiou Park (JOI17_park) C++17
100 / 100
 330 ms 868 KB 
#include "park.h"
#include <bits/stdc++.h>
using namespace std;
 
int N;
static int Place[1400];
bool Chk[1400];
int now;
vector <int> new_check;
vector <int> to_check;
vector <int> v[1400];
void solv(int s, int e)
{
    for(int i=s;i<=e;i++)   Place[to_check[i]]=0;
    int val=Ask(0, now, Place);
    if(val==1)  return;
    for(int i=s;i<=e;i++)   Place[to_check[i]]=1;
    if(s==e)
    {
        new_check.push_back(to_check[s]);
        return;
    }
    int mid=(s+e)/2;
    solv(s, mid);
    solv(mid+1, e);
}
bool cmp1(int a, int b)
{
    Place[a]=0;
    int val=Ask(0, b, Place);
    Place[a]=1;
    return val==0;
}
vector <int> tree[1400];
vector <int> euler;
void dfs(int now, int pre)
{
    euler.push_back(now);
    for(int nxt : tree[now])   if(nxt!=pre)
    {
        dfs(nxt, now);
        euler.push_back(now);
    }
}
void solv_par(int now, int pre)
{
    euler.clear();
    dfs(0, -1);
    for(int i=0;i<N;i++)    Place[i]=0;
    Place[now]=1;
    set <int> s;
    s.insert(euler.size());
    vector <int> adj;
    if(pre!=-1)
    {
        adj.push_back(pre);
        for(int i=0;i<euler.size();i++)    if(euler[i]==pre)   s.insert(i);
    }
    int cur=0;
    while(!s.empty())
    {
        int nxt=*s.begin();
        s.erase(s.begin());
        if(cur==nxt)
        {
            cur++;
            continue;
        }
        for(int i=cur;i<=nxt-1;i++) Place[euler[i]]=1;
        int check_val=Ask(min(now, euler[cur]), max(now, euler[cur]), Place);
        for(int i=cur;i<=nxt-1;i++) Place[euler[i]]=0;
        if(check_val==0)
        {
            cur=nxt+1;
            continue;
        }
        s.insert(nxt);
        int l=cur, r=nxt-1;
        assert(l<=r);
        while(l!=r)
        {
            int mid=(l+r)/2;
            for(int i=l;i<=mid;i++) Place[euler[i]]=1;
            int val=Ask(min(now, euler[l]), max(now, euler[l]), Place);
            for(int i=l;i<=mid;i++) Place[euler[i]]=0;
            if(val==1)  r=mid;
            else    l=mid+1;
        }
        for(int i=0;i<euler.size();i++) if(euler[i]==euler[l])  s.insert(i);
        adj.push_back(euler[l]);
        cur=l;
    }
    assert(!adj.empty());
    tree[now].push_back(adj[0]);
    tree[adj[0]].push_back(now);
    for(int ele : adj)
    {
        v[ele].push_back(now);
        v[now].push_back(ele);
    }
}
void Detect(int T, int n) {
    N=n;
    Chk[0]=true;
    for(int i=1;i<N;i++)    to_check.push_back(i);
    while(!to_check.empty())
    {
        for(int i=0;i<N;i++)    Place[i]=1;
        now=to_check.back();
        to_check.pop_back();
        new_check.push_back(now);
        if(!to_check.empty())   solv(0, to_check.size()-1);
        sort(new_check.begin(), new_check.end(), cmp1);
        solv_par(new_check[0], -1);
        for(int i=1;i<new_check.size();i++)
        {
            solv_par(new_check[i], new_check[i-1]);
        }
        for(int ele : new_check)    Chk[ele]=true;
        new_check.clear();
        to_check.clear();
        for(int i=0;i<N;i++)    if(!Chk[i]) to_check.push_back(i);
    }
    /*for(int i=0;i<N;i++)
    {
        printf("%d: ", i);
        for(int ele : v[i]) printf("%d ", ele);
        printf("\n");
    }*/
    for(int i=0;i<N;i++)
    {
        for(int ele : v[i]) if(ele<i)   Answer(ele, i);
    }
}

Compilation message

park.cpp: In function 'void solv_par(int, int)':
park.cpp:57:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |         for(int i=0;i<euler.size();i++)    if(euler[i]==pre)   s.insert(i);
      |                     ~^~~~~~~~~~~~~
park.cpp:89:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |         for(int i=0;i<euler.size();i++) if(euler[i]==euler[l])  s.insert(i);
      |                     ~^~~~~~~~~~~~~
park.cpp: In function 'void Detect(int, int)':
park.cpp:115:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |         for(int i=1;i<new_check.size();i++)
      |                     ~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 6 ms 408 KB Output is correct
3 Correct 6 ms 416 KB Output is correct
4 Correct 10 ms 332 KB Output is correct
5 Correct 15 ms 420 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 278 ms 732 KB Output is correct
2 Correct 138 ms 600 KB Output is correct
3 Correct 149 ms 644 KB Output is correct
4 Correct 280 ms 524 KB Output is correct
5 Correct 330 ms 564 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 760 KB Output is correct
2 Correct 192 ms 460 KB Output is correct
3 Correct 198 ms 464 KB Output is correct
4 Correct 193 ms 480 KB Output is correct
5 Correct 260 ms 532 KB Output is correct
6 Correct 186 ms 496 KB Output is correct
7 Correct 196 ms 548 KB Output is correct
8 Correct 197 ms 472 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 476 KB Output is correct
2 Correct 225 ms 508 KB Output is correct
3 Correct 233 ms 588 KB Output is correct
4 Correct 230 ms 588 KB Output is correct
5 Correct 226 ms 600 KB Output is correct
6 Correct 220 ms 496 KB Output is correct
7 Correct 229 ms 608 KB Output is correct
8 Correct 223 ms 540 KB Output is correct
9 Correct 215 ms 492 KB Output is correct
10 Correct 226 ms 528 KB Output is correct
11 Correct 215 ms 568 KB Output is correct
12 Correct 207 ms 488 KB Output is correct
13 Correct 253 ms 480 KB Output is correct
14 Correct 210 ms 500 KB Output is correct
15 Correct 246 ms 460 KB Output is correct
16 Correct 192 ms 504 KB Output is correct
17 Correct 300 ms 572 KB Output is correct
18 Correct 213 ms 568 KB Output is correct
19 Correct 243 ms 572 KB Output is correct
20 Correct 242 ms 596 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 488 KB Output is correct
2 Correct 256 ms 580 KB Output is correct
3 Correct 225 ms 480 KB Output is correct
4 Correct 227 ms 500 KB Output is correct
5 Correct 231 ms 488 KB Output is correct
6 Correct 264 ms 868 KB Output is correct
7 Correct 245 ms 512 KB Output is correct
8 Correct 236 ms 580 KB Output is correct
9 Correct 259 ms 624 KB Output is correct
10 Correct 210 ms 512 KB Output is correct
11 Correct 216 ms 544 KB Output is correct
12 Correct 263 ms 576 KB Output is correct
13 Correct 218 ms 488 KB Output is correct
14 Correct 259 ms 628 KB Output is correct
15 Correct 208 ms 500 KB Output is correct
16 Correct 201 ms 552 KB Output is correct
17 Correct 280 ms 548 KB Output is correct
18 Correct 180 ms 556 KB Output is correct