제출 #1177077

#제출 시각아이디문제언어결과실행 시간메모리
1177077mychecksedadBroken Device 2 (JOI22_device2)C++20
0 / 100
461 ms24184 KiB
#include "Anna.h" #include<bits/stdc++.h> using namespace std; #define ll long long int #define MOD (1000000000+7) #define MOD1 (998244353) #define pb push_back #define all(x) x.begin(), x.end() #define en cout << '\n' #define ff first #define ss second #define pii pair<int,int> #define vi vector<int> const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30; namespace { int variable_example = 0; } int Declare() { variable_example++; return 2000; } std::pair<std::vector<int>, std::vector<int> > Anna(long long A) { vi X, Y; for(int i = 0; i < 2000; ++i) X.pb(1); for(ll j = 0; j < 40; ++j){ bool bit = (1ll<<j) & A; for(int i = j * 50; i < j * 50 + 50; ++i){ Y.pb(bit); } } return {X, Y}; }
#include "Bruno.h" #include<bits/stdc++.h> using namespace std; #define ll long long int #define MOD (1000000000+7) #define MOD1 (998244353) #define pb push_back #define all(x) x.begin(), x.end() #define en cout << '\n' #define ff first #define ss second #define pii pair<int,int> #define vi vector<int> const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30; namespace { int variable_example = 0; } long long Bruno(std::vector<int> u) { ll ans = 0; for(ll i = 0; i < 40; ++i){ int sum = 0; for(int j = i*100; j < i*100+100; ++j){ if(u[j] == 0) sum++; } if(sum <= 25) ans += (1ll<<i); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...