# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
509957 | omohamadooo | Football (info1cup20_football) | C++14 | 58 ms | 2044 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll,ll >
#define F first
#define S second
#define double long double
#define all(x) (x).begin(),(x).end()
using namespace std;
using namespace __gnu_pbds;
typedef tree<ll , null_type , less<ll> ,rb_tree_tag ,tree_order_statistics_node_update >ordered_set;
const int MOD=1e9+7 ;
const int N=1e6+7;
const ll INF= 1e18+10;
long long po(ll x,ll y)
{
ll ans=1;
while(y){
if(y&1)
ans*=x;
y/=2;
x*=x;
//ans%=MOD;
//x%=MOD;
}
return ans;
}
ll n;
ll k;
ll a[N];
ll ctr[40];
void solve()
{
ll ctr2 = 0,ctr4 = 0;
cin>>n>>k;
ll sm = 0;
for(ll i=1;i<=n;i++){
cin>>a[i];
sm += a[i];
for(ll j= 2,w = 1;j<=a[i] ;j*=2,w++){
ctr[w] += a[i] / j;
}
}
if(sm & 1){
cout<<1;
return;
}
for(ll i= 1;i<=33;i++){
if((1LL << i) > k) break;
if(ctr[i] &1){
cout<<1;
return;
}
}
cout<<0;
return;
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//freopen("input.txt" , "r" , stdin);freopen("output.txt" , "w" , stdout);
int t = 1;
cin >> t;
while(t--) {solve() ; for(ll i=1;i<39;i++) ctr[i] = 0;}
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |