# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
329824 | TLP39 | Solar Storm (NOI20_solarstorm) | C++14 | 435 ms | 118620 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 main()
{
int n,s;
long long int k;
scanf("%d %d %lld",&n,&s,&k);
int d[n+1]={};
int v[n]={};
for(int i=1;i<n;i++)
{
scanf("%d",&d[i]);
}
for(int i=0;i<n;i++)
{
scanf("%d",&v[i]);
}
int ma[n]={};
int po=0,pr=0;
long long int sum=0;
while(po<n || pr<n)
{
if(po==n)
{
ma[pr]=n-1;
pr++;
}
else if(sum<=k)
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |