oj.uz

답안 #472010

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
472010 2021-09-12T10:14:45 Z NhatMinh0208 Mouse (info1cup19_mouse) C++14
100 / 100
 87 ms 328 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> vec;
vector<int> vec2;
vector<pii(int)> bruh;
vector<pii(int)> ac;
vector<int> gt[257];
vector<int> cyc;
int used[257];
int n,m,i,j,k,t,t1,u,v,a,b;

#include "grader.h"

int query(vector<int> v);

void dnc(int l, int r, int x) {
    if (!x) return;
    if (r-l==1) {
        ac.push_back(bruh[l]);
    } else {
        int mid=(l+r)/2,u;
        for (int i = l; i<mid;i++) {
            swap(vec[bruh[i].fi-1],vec[bruh[i].se-1]);
        }
        u = query(vec);
        for (int i = l; i<mid;i++) {
            swap(vec[bruh[i].fi-1],vec[bruh[i].se-1]);
        }
        dnc(l,mid,u);
        dnc(mid,r,x-u);
    }
}

void dfs(int x) {
    used[x]=1;
    cyc.push_back(x);
    for (auto g : gt[x]) if (!used[g]) dfs(g);
}

void solve(int N)
{

    for (i=1;i<=N;i++) vec.push_back(i);
    if (N<=4) {
        while(true) {
            u = query(vec);
            if (u==N) return;
            next_permutation(vec.begin(),vec.end());
        }
    }
    else {
        while(true) {
            random_shuffle(vec.begin(),vec.end());
            u = query(vec);
            if (u == N) return;
            if (u == 0) break;
        }
        // cout<<"done\n";
        // for (auto g : vec) {
            // cout<<g<<' ';
        // }
        // cout<<"\n";
        for (i=1;i<=N;i++) vec2.push_back(i);
        if (N%2) {vec2.push_back(0);}
        v = vec2.size();
        for (i=0;i<v-1;i++) {
            bruh.clear();
            for (j=0;j<v/2;j++) {
                if (vec2[j] && vec2[v-1-j]) {
                    bruh.push_back({vec2[j],vec2[v-1-j]});
                }
            }

                for (auto g : bruh) {
                    // cout<<g.fi<<' '<<g.se<<endl;
                    swap(vec[g.fi-1],vec[g.se-1]);
                }
                u = query(vec);
                for (auto g : bruh) {
                    swap(vec[g.fi-1],vec[g.se-1]);
                }
                dnc(0,v/2,u);
                // cout<<endl;
            u = vec2.back();
            vec2.pop_back();
            vec2.insert(vec2.begin()+1,u);
        }
        // cout<<"done\n";
        for (auto g : ac) {
                    // cout<<g.fi<<' '<<g.se<<endl;
            gt[g.fi].push_back(g.se);
            gt[g.se].push_back(g.fi);
        }
        // cout<<endl;
        u=0;
        v=0;
        for (j=1;j<=N;j++) if (!used[j]) {
            // cout<<j<<endl;
            cyc.clear();
            dfs(j);
            u+=cyc.size();
            // for (auto g : cyc) {
                // cout<<g<<' ';
            // }
            // cout<<endl;
            for (i=0;i<cyc.size()-1;i++) {
                swap(vec[cyc[i]-1],vec[cyc[i+1]-1]);
            }
            if (query(vec) < u) {
                v=1;
                for (i=cyc.size()-2;i>=0;i--) {
                    swap(vec[cyc[i]-1],vec[cyc[i+1]-1]);
                }
                for (i=cyc.size()-2;i>=0;i--) {
                    swap(vec[cyc[i]-1],vec[cyc[i+1]-1]);
                }
            } else {
                v=0;
            }
        }
        if (v) query(vec);
    }
}
// Normie28;
/*
123456
134562
145623
156234
162345
cout<<i<<endl;
14
15
16
12
13
25
36
24
35
46
36
24
35
46
25
*/

Compilation message

mouse.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      | 
mouse.cpp: In function 'void solve(int)':
mouse.cpp:203:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  203 |             for (i=0;i<cyc.size()-1;i++) {
      |                      ~^~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 292 KB Correct! Number of queries: 22
2 Correct 1 ms 200 KB Correct! Number of queries: 18
3 Correct 1 ms 200 KB Correct! Number of queries: 16
4 Correct 1 ms 200 KB Correct! Number of queries: 22
5 Correct 1 ms 200 KB Correct! Number of queries: 22
6 Correct 1 ms 200 KB Correct! Number of queries: 29

Subtask #2
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 292 KB Correct! Number of queries: 22
2 Correct 1 ms 200 KB Correct! Number of queries: 18
3 Correct 1 ms 200 KB Correct! Number of queries: 16
4 Correct 1 ms 200 KB Correct! Number of queries: 22
5 Correct 1 ms 200 KB Correct! Number of queries: 22
6 Correct 1 ms 200 KB Correct! Number of queries: 29
7 Correct 6 ms 200 KB Correct! Number of queries: 300
8 Correct 4 ms 200 KB Correct! Number of queries: 300
9 Correct 4 ms 200 KB Correct! Number of queries: 300
10 Correct 5 ms 200 KB Correct! Number of queries: 300
11 Correct 4 ms 200 KB Correct! Number of queries: 300
12 Correct 5 ms 200 KB Correct! Number of queries: 300
13 Correct 4 ms 200 KB Correct! Number of queries: 300
14 Correct 4 ms 200 KB Correct! Number of queries: 300
15 Correct 3 ms 300 KB Correct! Number of queries: 300
16 Correct 5 ms 328 KB Correct! Number of queries: 300

Subtask #3
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 292 KB Correct! Number of queries: 22
2 Correct 1 ms 200 KB Correct! Number of queries: 18
3 Correct 1 ms 200 KB Correct! Number of queries: 16
4 Correct 1 ms 200 KB Correct! Number of queries: 22
5 Correct 1 ms 200 KB Correct! Number of queries: 22
6 Correct 1 ms 200 KB Correct! Number of queries: 29
7 Correct 6 ms 200 KB Correct! Number of queries: 300
8 Correct 4 ms 200 KB Correct! Number of queries: 300
9 Correct 4 ms 200 KB Correct! Number of queries: 300
10 Correct 5 ms 200 KB Correct! Number of queries: 300
11 Correct 4 ms 200 KB Correct! Number of queries: 300
12 Correct 5 ms 200 KB Correct! Number of queries: 300
13 Correct 4 ms 200 KB Correct! Number of queries: 300
14 Correct 4 ms 200 KB Correct! Number of queries: 300
15 Correct 3 ms 300 KB Correct! Number of queries: 300
16 Correct 5 ms 328 KB Correct! Number of queries: 300
17 Correct 87 ms 288 KB Correct! Number of queries: 1900
18 Correct 66 ms 200 KB Correct! Number of queries: 1800
19 Correct 61 ms 200 KB Correct! Number of queries: 1800
20 Correct 68 ms 304 KB Correct! Number of queries: 1900
21 Correct 70 ms 200 KB Correct! Number of queries: 1900
22 Correct 65 ms 284 KB Correct! Number of queries: 1800
23 Correct 63 ms 324 KB Correct! Number of queries: 1800
24 Correct 71 ms 200 KB Correct! Number of queries: 1900
25 Correct 73 ms 284 KB Correct! Number of queries: 1900
26 Correct 68 ms 288 KB Correct! Number of queries: 1900