# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
504556 | ToroTN | Lottery (CEOI18_lot) | C++14 | 1067 ms | 8256 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>
using namespace std;
int n,a[10005],m,t,num[105],idx[10005],ans[105][10005],qs[10005];
vector<pair<int,int> > v;
int query(int l,int r)
{
return qs[r]-qs[l-1];
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&t);
for(int i=1;i<=t;i++)
{
scanf("%d",&num[i]);
v.push_back({num[i],i});
}
sort(v.begin(),v.end());
for(int i=0;i<v.size();i++)
{
idx[v[i].first]=i+1;
}
for(int i=10000;i>=1;i--)
{
if(i>v[v.size()-1].first)
{
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... |