# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
412017 | alishahali1382 | Broken Device (JOI17_broken_device) | C++14 | 60 ms | 2396 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "Annalib.h"
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;
const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=210, LOG=60;
int bad[MAXN];
int P[MAXN], Q[MAXN];
void Anna(int n, ll x, int k, int A[]){
iota(P, P+n, 0);
for (int i=1; i<n; i++) swap(P[i], P[(4*i)/5]);
for (int i=0; i<n; i++) Q[P[i]]=i;
for (int i=0; i<n; i++) bad[i]=0;
for (int i=0; i<k; i++) bad[A[i]]=1;
string S;
for (int i=0; i<n; i+=2){
if (bad[i]+bad[i+1]==0){
ll y=x%3;
x/=3;
// debug(y)
if (y==0) S+="01";
if (y==1) S+="10";
if (y==2) S+="11";
}
else{
S+="00";
}
}
for (int i=0; i<n; i++) Set(Q[i], S[i]-'0');
// debug(S)
return ;
}
#include "Brunolib.h"
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;
const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=210, LOG=60;
int PP[MAXN], QQ[MAXN];
int A[MAXN];
ll Bruno(int n, int B[]){
iota(PP, PP+n, 0);
for (int i=1; i<n; i++) swap(PP[i], PP[(4*i)/5]);
for (int i=0; i<n; i++) QQ[PP[i]]=i;
for (int i=0; i<n; i++) A[i]=B[PP[i]];
vector<int> vec;
int pos=0;
for (int i=0; i<n; i+=2){
string S="";
S+=char('0'+A[i]);
S+=char('0'+A[i+1]);
if (S=="00") continue ;
if (S=="01") vec.pb(0);
if (S=="10") vec.pb(1);
if (S=="11") vec.pb(2);
}
reverse(all(vec));
ll res=0;
for (int x:vec) res=res*3ll+x;
// debug(res)
// debugv(vec)
return res;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |