Submission #818962

#TimeUsernameProblemLanguageResultExecution timeMemory
818962GangstaDetecting Molecules (IOI16_molecules)C++14
0 / 100
0 ms212 KiB
/* ID: didarco1 LANG: C++17 TASK: */ // a >> b = a / pow(2,b) // a << b = a * pow(2,b) #include <bits/stdc++.h> #define ll long long int #define pb push_back #define sz size() #define ss second #define ff first #define N 200001 #define pii pair<int,int> using namespace std; //ll _, x, n; vector<int> find_subset(int l, int u, vector<int> w){ int x = w[0], uly = 0, kici = 0, den = 0, sum = 0, n = w.sz; vector<int> result; result.resize(n); for(int i = 1; i < n; i++){ if(w[i] == x + 1) uly++; else if(w[i] == x - 1) kici++; else if(w[i] == x) den++; } if(den + 1 == n){ for(int i = 0; i < n; i++){ sum += w[i]; result[i] = w[i]; if(sum >= l and sum <= u) return result; } for(int i = 0; i < n; i++) result[i] = 0; return result; } return result; } //int main(){ // ios::sync_with_stdio(false); // cin.tie(0); // freopen(".in", "r", stdin); // freopen(".out", "w", stdout); //}
#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...