제출 #793415

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
793415		Antekb	Broken Device (JOI17_broken_device)	C++17	0 / 100	4 ms	512 KiB

Anna

#include<bits/stdc++.h>

#pragma GCC optimize("Ofast")
//#pragma GCC optimize("trapv")
 
#define st first
#define nd second
#define pb push_back
#define eb emplace_back
#define pp(x) pop_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)
 
using namespace std;
 
///~~~~~~~~~~~~~~~~~~~~~~~~~~
 
template <typename H, typename T> 
ostream& operator<<(ostream& os, pair<H, T> m){
	return os <<"("<< m.st<<", "<<m.nd<<")";
}
template <typename H> 
ostream& operator<<(ostream& os, vector<H> V){
	os<<"{";
	for(int i=0; i<V.size(); i++){
		if(i)os<<" ";
		os<<V[i];
	}
	os<<"}";
	return os;
}
 
void debug(){cerr<<"\n";}
template <typename H, typename... T>
void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);}
#define deb(x...) cerr<<#x<<" = ";debug(x);
//#define deb(x...) ;
 
///~~~~~~~~~~~~~~~~~~~~~~~~~
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef string str;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

 
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const int K=17, N=1<<20, INF=1e9+5, mod2=1e9+7, mod=998244353;

struct modint{
	int n=0;
	modint(){}
	modint(ll x){
		n=x%mod;
		if(n<0)n+=mod;
	}
	operator int(){
		return n;
	}
	modint operator+(modint a){a.n = n+a.n; if(a.n>=mod)a.n-=mod;return a;}
	modint operator+=(modint a){return (*this)=(*this)+a;}
	modint operator-(modint a){a.n = n-a.n; if(a.n<0)a.n+=mod;return a;}
	modint operator-=(modint a){return (*this)=(*this)-a;}
	modint operator*(modint a){a.n = (n*1ll*a.n)%mod; return a;}
	modint operator*=(modint a){return (*this)=(*this)*a;}
	modint operator^(const ll &m)const{
		modint a(1);
		if(m==0)return a;
		if(m==1)return (*this);
		a=(*this)^(m/2);
		a*=a;
		return a*((*this)^(m&1));
	}
	modint odw(){
		return (*this)^((ll)mod-2);
	}
	modint operator/(modint a){return (*this)*a.odw();}
	modint operator/=(modint a){return (*this)=(*this)/a;}
	bool operator==(modint a){return a.n==n;}
	friend ostream& operator<<(ostream& os, modint m) {
		return os << m.n; 
	}
};
/*modint fact[N], fact2[N];
typedef vector<modint> vm;
void factinit(){
    fact[0]=1;
    for(int i=1; i<N; i++){
        fact[i]=(fact[i-1]*modint(i))%mod;
    }
    fact2[N-1]=fact[N-1].odw();
    for(int i=N-2; i>=0; i--){
    	fact2[i]=(fact2[i+1]*modint(i+1))%mod;
    }
}
modint npok(int _n, int _k){
 	if(_n<_k)return 0;
    return fact[_n]*fact2[_k]*fact2[_n-_k];
}*/
int los(int a, int b){
	return a+(rng())%(b-a+1);
}
#include "Annalib.h"

void Anna( int n, long long X, int K, int P[] ){
	X--;
	srand(24636346);
	vi kol(n), co(n);
	iota(all(kol), 0);
	random_shuffle(all(kol));
	vi val(n);
	int blo=6;
	int pot=1000;
	for(int i=0; i<n; i++){
		val[i]=rand()%pot;
		co[kol[i]]=i;
	}
	for(int i=0; i<K; i++){
		val[kol[P[i]]]=0;
	}
	vi ans(n);
	for(int i=0; i<blo; i++){
		//deb(i);
		int reszta=X%pot;
		X/=pot;
		vi tim(pot, 1e9);
		tim[0]=-1;
		for(int j=i*n/blo; j<(i+1)*n/blo; j++){
			int t=val[j];
			//deb(t);
			for(int i=t; i<pot; i++){
				if(tim[i]==1e9 && tim[i-t]<j)tim[i]=j;
			}
			for(int i=0; i<t; i++){
				if(tim[i]==1e9 && tim[i+pot-t]<j)tim[i]=j;
			}
			if(tim[reszta]!=1e9){
				//deb("a");
				break;
			}
		}
		while(reszta){
			//deb(reszta);
			ans[co[tim[reszta]]]=1;
			int t=val[tim[reszta]];
			reszta=(reszta+pot-t)%pot;
		}
	}
	for( int i = 0; i < n; i++ ){
		Set( i, ans[i] );
	}
}

Bruno

#include<bits/stdc++.h>

#pragma GCC optimize("Ofast")
//#pragma GCC optimize("trapv")
 
#define st first
#define nd second
#define pb push_back
#define eb emplace_back
#define pp(x) pop_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)
 
using namespace std;
 
///~~~~~~~~~~~~~~~~~~~~~~~~~
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef string str;

#include "Brunolib.h"

long long Bruno( int n, int A[] ){
	srand(24636346);
	vi kol(n), co(n);
	iota(all(kol), 0);
	random_shuffle(all(kol));
	vi val(n);
	int blo=6;
	int pot=1000;
	for(int i=0; i<n; i++){
		val[i]=rand()%pot;
		co[kol[i]]=i;
	}
	ll ans=0;
	for(int i=blo-1; i>=0; i--){
		ans*=pot;
		int reszta=0;
		for(int j=i*n/blo; j<(i+1)*n/blo; j++){
			if(A[co[j]]){
				reszta+=val[j];
			}
		}
		ans+=reszta;
	}
	return ans+1;
}

• Subtask 1: 0 / 100