# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
78349 | igzi | Lottery (CEOI18_lot) | C++17 | 2205 ms | 11056 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define maxN 10005
using namespace std;
vector <int> v;
vector <pair<int,int>> u;
int n,l,q,k[maxN][105],s[2*maxN],ans[105],x,i,j;
void update(int koji,int p){
//cout<<koji<<" "<<p<<endl;
while(p<=u.size()){
k[koji][p]++;
p+=p & (-p);
}
}
int query(int koji,int p){
int ans=0;
while(p>0){
ans+=k[koji][p];
p-=p & (-p);
}
return ans;
}
void ispisi(int x){
int i,j;
for(i=0;i<u.size();i++){
if(u[i].second==x){
Compilation message (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... |