oj.uz

Submission #202179

# Submission time Handle Problem Language Result Execution time Memory
202179 2020-02-14T04:28:42 Z Segtree Amusement Park (JOI17_amusement_park) C++14
0 / 100
 32 ms 2172 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)));
    }
}
//----------------

/*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<<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(){
    
}*/

Compilation message

Ioi.cpp: In function 'll Ioi(int, int, int*, int*, int, int, int)':
Ioi.cpp:20:8: warning: unused variable 'R' [-Wunused-variable]
     ll R=P/60*60;
        ^

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 872 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 2168 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 976 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 2172 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 2136 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -