oj.uz

답안 #202181

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
202181 2020-02-14T04:33:51 Z Segtree Amusement Park (JOI17_amusement_park) C++14
10 / 100
 32 ms 2332 KB 
#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%60))));
    }
}
//----------------

/*int main(){
    
}*/



#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<<(P%60))*V;
	    P++;
	    if(0<=P&&P<N)V=Move(P);
	}
    }
    else{
	rep(i,60){
	    ans+=(1LL<<(P%60))*V;
	    P--;
	    if(0<=P&&P<N)V=Move(P);
	}
    }
    return ans;
}
/*int main(){
    
}*/

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 10 ms 1008 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 30 ms 2204 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 984 KB Output is correct
2 Correct 10 ms 1012 KB Output is correct
3 Correct 10 ms 856 KB Output is correct
4 Correct 11 ms 952 KB Output is correct
5 Correct 12 ms 968 KB Output is correct
6 Correct 11 ms 980 KB Output is correct
7 Correct 11 ms 972 KB Output is correct
8 Correct 11 ms 972 KB Output is correct
9 Correct 19 ms 1720 KB Output is correct
10 Correct 20 ms 1972 KB Output is correct
11 Correct 20 ms 1960 KB Output is correct
12 Correct 10 ms 984 KB Output is correct
13 Correct 10 ms 980 KB Output is correct
14 Correct 10 ms 1012 KB Output is correct
15 Correct 10 ms 976 KB Output is correct

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 32 ms 2136 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 31 ms 2332 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -