oj.uz

답안 #655006

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
655006 2022-11-02T12:02:18 Z Hiennoob123 도서관 (JOI18_library) C++14
100 / 100
 489 ms 588 KB 
#include<bits/stdc++.h>
#include "library.h"
#define ll int
//#define int long long
#define ld long double
#define cd complex<ld>
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pld pair<ld,ld>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std ;
ll n ;
bool check[1005] ;
ll deg[1005] ;
vector<ll> T[1005] ;
ll own[1005] ;
vector<pll> Edge ;
ll cnt_query= 0  ;
ll ask(ll l , ll r , ll num)
{
    vector<ll> que1(n , 0) , que2(n , 0) ;
    que1[num-1] = 1 ;
    for(int i = l ; i<= r ; i++)
    {
        que1[i-1] = que2[i-1] = 1 ;
    }
    cnt_query += 2 ;
    if(cnt_query>20000)
    {
        exit(69);
    }
    return (r-l+2-Query(que1)) - (r-l+1-Query(que2)) ;
}
ll ask(ll num)
{
    vector<ll> que1(n , 0) , que2(n , 0) ;
    for(int i = 1 ; i<= n ; i++)
    {
        que1[i-1] = que2[i-1] = 1 ;
    }
    que2[num-1] = 0 ;
    cnt_query += 2 ;
    if(cnt_query>20000)
    {
        exit(69);
    }
    //cout << Query(que1) << " " << Query(que2) << "\n" ;
    return (n-Query(que1)) - (n-1-Query(que2)) ;
}
void dnc(ll l , ll r , ll num , ll sum)
{
    if(sum==0) return ;
    if(r-l<1)
    {
        return ;
    }
    //cout << l << " " << r << " " << num << "\n" ;
    ll mid = ((l+r)>>1) ;
    ll this1 = ask(l , mid , num) ;
    if(this1>0)
    {
        if(l==mid)
        {
            Edge.push_back(mp(num , l)) ;
            deg[num]++ ;
            deg[l]++ ;
        }
        else
        {
            dnc(l , mid , num , this1) ;
        }
    }
    //cout << deg[num] << "\n" ;
    if(this1>=sum) return  ;
    ll this2 = 1 ;
    if(this2>0)
    {
        if(r==mid+1)
        {
            Edge.push_back(mp(num , r)) ;
            deg[num]++ ;
            deg[l]++ ;
        }
        else
        {
            dnc(mid+1 , r , num , sum-this1) ;
        }
    }
    //deg[num] += this2 ;
}
bool val[1005] = {} ;
void Solve(int m)
{
    n = m ;
    if(n==1)
    {
        vector<ll> ans(1 , 1) ;
        Answer(ans) ;
        return ;
    }
    for(int i = 1 ; i< n-1 ; i++)
    {
        dnc(i+1 , n , i , ask(i+1 , n , i)) ;
    }
    if(n>1)
    {
        cnt_query += 1 ;
        if(cnt_query>20000)
        {
            exit(69) ;
        }
        vector<ll> que(n , 0);
        que[n-1] = que[n-2] = 1 ;
        //cout << Query(que) << "\n" ;
        if(Query(que)==1) Edge.push_back(mp(n-1 , n)) ;
    }
    for(int i = 0; i< Edge.size() ; i++)
    {
        //cout << Edge[i].fi << " " << Edge[i].se << "\n" ;
        T[Edge[i].fi].push_back(Edge[i].se) ;
        T[Edge[i].se].push_back(Edge[i].fi) ;
    }
    vector<ll> ans ;
    queue<ll> q ;
    for(int i = 1 ; i<= n ; i++)
    {
        if(T[i].size()==1)
        {
            q.push(i) ;
            break ;
        }
    }
    while(!q.empty())
    {
        ll x = q.front();
        q.pop() ;
        if(check[x]) continue ;
        check[x] = 1 ;
        ans.push_back(x) ;
        val[x] = 1 ;
        //cout << x << " " ;
        for(int i = 0; i< T[x].size() ; i++)
        {
            q.push(T[x][i]) ;
        }
    }
    //for(int i = 1 ; i<= n ; i++) if(ans[i-1]!=i) cout << i << "\n" ;
    //cout << cnt_query << "\n" ;
    //assert(ans.size()>=n) ;
    //cout << ans.size() << "-1" << endl;
    Answer(ans) ;
}

Compilation message

library.cpp: In function 'void Solve(int)':
library.cpp:120:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for(int i = 0; i< Edge.size() ; i++)
      |                    ~^~~~~~~~~~~~~
library.cpp:145:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  145 |         for(int i = 0; i< T[x].size() ; i++)
      |                        ~^~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 336 KB # of queries: 2767
2 Correct 41 ms 340 KB # of queries: 2761
3 Correct 26 ms 336 KB # of queries: 2913
4 Correct 44 ms 336 KB # of queries: 2935
5 Correct 38 ms 464 KB # of queries: 2943
6 Correct 44 ms 316 KB # of queries: 2951
7 Correct 44 ms 336 KB # of queries: 2971
8 Correct 41 ms 336 KB # of queries: 2801
9 Correct 36 ms 316 KB # of queries: 2903
10 Correct 22 ms 332 KB # of queries: 1707
11 Correct 0 ms 336 KB # of queries: 0
12 Correct 0 ms 208 KB # of queries: 1
13 Correct 0 ms 208 KB # of queries: 5
14 Correct 0 ms 336 KB # of queries: 11
15 Correct 3 ms 336 KB # of queries: 101
16 Correct 3 ms 328 KB # of queries: 235

Subtask #2
81.0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 336 KB # of queries: 2767
2 Correct 41 ms 340 KB # of queries: 2761
3 Correct 26 ms 336 KB # of queries: 2913
4 Correct 44 ms 336 KB # of queries: 2935
5 Correct 38 ms 464 KB # of queries: 2943
6 Correct 44 ms 316 KB # of queries: 2951
7 Correct 44 ms 336 KB # of queries: 2971
8 Correct 41 ms 336 KB # of queries: 2801
9 Correct 36 ms 316 KB # of queries: 2903
10 Correct 22 ms 332 KB # of queries: 1707
11 Correct 0 ms 336 KB # of queries: 0
12 Correct 0 ms 208 KB # of queries: 1
13 Correct 0 ms 208 KB # of queries: 5
14 Correct 0 ms 336 KB # of queries: 11
15 Correct 3 ms 336 KB # of queries: 101
16 Correct 3 ms 328 KB # of queries: 235
17 Correct 489 ms 460 KB # of queries: 19279
18 Correct 392 ms 456 KB # of queries: 19031
19 Correct 453 ms 344 KB # of queries: 19099
20 Correct 292 ms 588 KB # of queries: 18005
21 Correct 363 ms 340 KB # of queries: 16977
22 Correct 472 ms 336 KB # of queries: 19283
23 Correct 399 ms 340 KB # of queries: 19163
24 Correct 145 ms 452 KB # of queries: 8813
25 Correct 445 ms 348 KB # of queries: 18805
26 Correct 344 ms 340 KB # of queries: 17491
27 Correct 137 ms 336 KB # of queries: 8805
28 Correct 443 ms 348 KB # of queries: 19931
29 Correct 425 ms 460 KB # of queries: 19909
30 Correct 435 ms 460 KB # of queries: 19931