# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1119 | jiws829 | 탐사 (KOI13_probe) | C++98 | 2084 ms | 376 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<stdio.h>
#include<algorithm>
using namespace std;
int n,m;
int p[41];
struct pp
{
int a,b,c;
int d;
}t[1001];
int che=0;
int check()
{
int i,j;
int cnt;
for(i=0;i<m;i++)
{
cnt=0;
for(j=t[i].a;j<=t[i].b;j++)
{
cnt+=p[j];
}
if(cnt!=t[i].c) return 0;
}
return 1;
}
void make(int v)
{
if(che) return;
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... |