제출 #202177

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
202177		Segtree	Amusement Park (JOI17_amusement_park)	C++14	0 / 100	36 ms	2412 KiB

Joi

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<unordered_set>
#include<unordered_map>
#include"Joi.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define chmax(a,b) a=max(a,b)
#define chmin(a,b) a=min(a,b)
#define all(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
#define mad(a,b) a=(a+b)%mod
void Joi(int N,int M,int A[],int B[],ll X,int T){
    for(int i=0;i<N;i++){
	MessageBoard(i,!!(X&(1LL<<i)));
    }
}
//----------------

/*int main(){
    
}*/

Ioi

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<unordered_set>
#include<unordered_map>
#include"Ioi.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define chmax(a,b) a=max(a,b)
#define chmin(a,b) a=min(a,b)
#define all(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
#define mad(a,b) a=(a+b)%mod

ll Ioi(int N,int M,int A[],int B[],int P,int V,int T){
    ll R=P/60*60;
    while(P>R){
	P--;
	V=Move(P);
    }
    ll ans=0;
    /*if(P==0){
	rep(i,60){
	    ans+=(1LL<<i)*V;
	    P++;
	    if(0<=P&&P<N)V=Move(P);
	}
    }
    else{
	rep(i,60){
	    ans+=(1LL<<i)*V;
	    P--;
	    if(0<=P&&P<N)V=Move(P);
	}
    }*/
    return ans;
}
/*int main(){
    
}*/

• Subtask 1: 0 / 8
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 55
• Subtask 5: 0 / 17