oj.uz

답안 #402866

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
402866 2021-05-12T12:57:32 Z rrrr10000 The Collection Game (BOI21_swaps) C++14
25 / 100
 102 ms 516 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
#include"swaps.h"
void solve(int n,int k){
    vb done(n,false);
    vector<int> ans;
    rep(t,n){
        vector<int> v;
        rep(i,n)if(!done[i])v.pb(i);
        while(v.size()>1){
            rep(i,v.size()/2)schedule(v[i*2]+1,v[i*2+1]+1);
            vector<int> res=visit(),nv;
            rep(i,v.size()/2)nv.pb(v[i*2+1-res[i]]);
            if(v.size()%2)nv.pb(v.back());
            v=nv;
        }
        ans.pb(v[0]+1);
        done[v[0]]=true;
    }
    answer(ans);
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 10 ms 288 KB Correct
3 Correct 28 ms 296 KB Correct
4 Correct 91 ms 308 KB Correct
5 Correct 94 ms 308 KB Correct
6 Correct 84 ms 420 KB Correct
7 Correct 87 ms 312 KB Correct
8 Correct 89 ms 300 KB Correct

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 10 ms 200 KB Correct
3 Correct 35 ms 300 KB Correct
4 Correct 99 ms 420 KB Correct
5 Correct 96 ms 308 KB Correct
6 Correct 99 ms 424 KB Correct
7 Correct 82 ms 300 KB Correct
8 Correct 97 ms 300 KB Correct
9 Runtime error 33 ms 312 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 10 ms 200 KB Correct

Subtask #4
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 10 ms 200 KB Correct
3 Correct 1 ms 200 KB Correct
4 Correct 9 ms 292 KB Correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 9 ms 200 KB Correct
3 Correct 30 ms 276 KB Correct
4 Correct 94 ms 516 KB Correct

Subtask #6
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 9 ms 200 KB Correct
3 Correct 30 ms 276 KB Correct
4 Correct 94 ms 516 KB Correct
5 Correct 1 ms 200 KB Correct
6 Correct 10 ms 200 KB Correct
7 Correct 32 ms 284 KB Correct
8 Correct 94 ms 412 KB Correct
9 Correct 99 ms 308 KB Correct
10 Correct 65 ms 304 KB Correct
11 Correct 93 ms 408 KB Correct
12 Correct 79 ms 308 KB Correct
13 Correct 1 ms 200 KB Correct
14 Correct 8 ms 200 KB Correct
15 Correct 30 ms 296 KB Correct
16 Correct 92 ms 420 KB Correct

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 5 ms 288 KB Correct
3 Correct 32 ms 200 KB Correct
4 Correct 96 ms 300 KB Correct
5 Runtime error 17 ms 320 KB Execution killed with signal 11

Subtask #8
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 5 ms 288 KB Correct
3 Correct 32 ms 200 KB Correct
4 Correct 96 ms 300 KB Correct
5 Runtime error 17 ms 320 KB Execution killed with signal 11

Subtask #9
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 9 ms 200 KB Correct
3 Correct 26 ms 200 KB Correct
4 Correct 102 ms 420 KB Correct
5 Runtime error 17 ms 352 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 9 ms 200 KB Correct
3 Correct 26 ms 200 KB Correct
4 Correct 102 ms 420 KB Correct
5 Runtime error 17 ms 352 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #11
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 7 ms 200 KB Correct
3 Correct 25 ms 292 KB Correct
4 Correct 98 ms 424 KB Correct
5 Runtime error 17 ms 392 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #12
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Correct
2 Correct 7 ms 200 KB Correct
3 Correct 25 ms 292 KB Correct
4 Correct 98 ms 424 KB Correct
5 Runtime error 17 ms 392 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -