GravelProblem code: SPREAD |
All submissions for this problem are available.
Bob has n heap(s) of gravel (initially there are exactly c piece(s) in each). He wants to do m operation(s) with that heaps, each maybe:
- adding pieces of gravel onto the heaps from u to v, exactly k pieces for each,
- or querying "how many pieces of gravel are there in the heap p now?".
Request
Help Bob do operations of the second type.
Input
- The first line contains the integers n,m,c, respectively.
- m following lines, each forms:
- S u v k to describe an operation of the first type.
- Q p to describe an operation of the second type.
(Each integer on a same line, or between the characters S, Q and the integers is separated by at least one space character)
Output
For each operation of the second type, output (on a single line) an integer answering to the respective query (follows the respective Input order).
Example
Input:7 5 0 Q 7 S 1 7 1 Q 3 S 1 3 1 Q 3Output:
0 1 2
Limitations
- 0<n?106
- 0<m?250 000
- 0<u?v?n
- 0?c,k?109
- 0<p?n
| Author: | anhdq |
| Date Added: | 5-05-2010 |
| Time Limit: | 2 sec |
| Source Limit: | 50000 Bytes |
| Languages: | ADA, ASM, BASH, C, C99 strict, CLOJ, CPP 4.0.0-8, CPP 4.3.2, CS2, D, F#, FORT, GO, ICON, JAR, JAVA, LISP clisp, LISP sbcl, LUA, NEM, NICE, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PYTH, PYTH 3.1.2, RUBY, SCM guile, SCM qobi, ST, TCL |
Comments
SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:
HELP
Program should read from standard input and write to standard output. After you submit a solution you can see your results by clicking on the [My Submissions] tab on the problem page. Below are the possible results:
- Accepted
Your program ran successfully and gave a correct answer. If there is a score for the problem, this will be displayed in parenthesis next to the checkmark. - Time Limit Exceeded
Your program was compiled successfully, but it didn't stop before time limit. Try optimizing your approach. - Wrong Answer
Your program compiled and ran succesfully but the output did not match the expected output. - Runtime Error
Your code compiled and ran but encountered an error. The most common reasons are using too much memory or dividing by zero. For the specific error codes see the help section. - Compilation Error
Your code was unable to compile. When you see this icon, click on it for more information.
If you are still having problems, see a sample solution here.

Fetching successful submissions

Why am i getting wrong
Why am i getting wrong answer?
Could you please give me more test cases?
#include<stdio.h>
long long int a[1000050]={0};
long long int result,result1,result2,sum=0;
void scan(char str[])
{
int i=0,m;
result=0;
result1=0;
result2=0;
sum=0;
i=2;
while(str[i]!=' ')
{
switch(str[i])
{
case '0': m=0; break;
case '1': m=1; break;
case '2': m=2; break;
case '3': m=3; break;
case '4': m=4; break;
case '5': m=5; break;
case '6': m=6; break;
case '7': m=7; break;
case '8': m=8; break;
case '9': m=9; break;
}
if(str[i+1]==' ' || str[i+1]==' ')
{
sum=sum*10+m;
result=sum;
i++;
sum=0;
goto X;
}
else
{
sum=sum*10+m;
goto Y;
}
X:while(str[i]!=' ')
{
switch(str[i])
{
case '0': m=0; break;
case '1': m=1; break;
case '2': m=2; break;
case '3': m=3; break;
case '4': m=4; break;
case '5': m=5; break;
case '6': m=6; break;
case '7': m=7; break;
case '8': m=8; break;
case '9': m=9; break;
}
if(str[i+1]==' ')
{
sum=sum*10+m;
result1=sum;
i+=2;
sum=0;
goto S;
}
else
{
sum=sum*10+m;
goto Z;
}
S:while(str[i]!=' ')
{
switch(str[i])
{
case '0': m=0; break;
case '1': m=1; break;
case '2': m=2; break;
case '3': m=3; break;
case '4': m=4; break;
case '5': m=5; break;
case '6': m=6; break;
case '7': m=7; break;
case '8': m=8; break;
case '9': m=9; break;
}
if(str[i+1]==' ')
{
sum=sum*10+m;
result2=sum;
i++;
break;
}
else
{
sum=sum*10+m;
goto T;
}
T:i++;
}
Z:i++;
}
Y:i++;
}
}
int main()
{
long long int n,test;
long long int c;
int j;
char str[80]=" ";
scanf("%lld%lld%lld",&n,&test,&c);
for(j=0; j<=n; j++)
a[j]=c;
while(test--)
{
printf("n");
fflush(stdin);
gets(str);
scan(str);
if(str[0]=='Q')
printf("%lld",a[result]);
else
{
for(j=result; j<=result1; j++)
{
a[j]+=result2;
}
}
}
return 0;
}
This program is producing
This program is producing correct output in my computer but it is showing wrong output on this website.
Please tell me why?
#include<stdio.h>
#define max 1000050
long long a[max];
long long int result,result1,result2,sum=0;
void scan(char str[])
{
int i=0,m,flag=0;
result=0;
result1=0;
result2=0;
sum=0;
i=2;
while(str[i]!=' ')
{
switch(str[i])
{
case '0': m=0; break;
case '1': m=1; break;
case '2': m=2; break;
case '3': m=3; break;
case '4': m=4; break;
case '5': m=5; break;
case '6': m=6; break;
case '7': m=7; break;
case '8': m=8; break;
case '9': m=9; break;
}
if(str[i+1]==' ' || str[i+1]==' ')
{
sum=sum*10+m;
result=sum;
i++;
flag=0;
sum=0;
goto X;
}
else
{
sum=sum*10+m;
goto Y;
}
X:while(str[i]!=' ')
{
if(flag==0)
{
i++;
flag=1;
}
switch(str[i])
{
case '0': m=0; break;
case '1': m=1; break;
case '2': m=2; break;
case '3': m=3; break;
case '4': m=4; break;
case '5': m=5; break;
case '6': m=6; break;
case '7': m=7; break;
case '8': m=8; break;
case '9': m=9; break;
}
if(str[i+1]==' ')
{
sum=sum*10+m;
result1=sum;
i+=2;
sum=0;
goto S;
}
else
{
sum=sum*10+m;
goto Z;
}
S:while(str[i]!=' ')
{
switch(str[i])
{
case '0': m=0; break;
case '1': m=1; break;
case '2': m=2; break;
case '3': m=3; break;
case '4': m=4; break;
case '5': m=5; break;
case '6': m=6; break;
case '7': m=7; break;
case '8': m=8; break;
case '9': m=9; break;
}
if(str[i+1]==' ')
{
sum=sum*10+m;
result2=sum;
i++;
break;
}
else
{
sum=sum*10+m;
goto T;
}
T:i++;
}
Z:i++;
}
Y:i++;
}
}
int main()
{
long long int n,test;
long long int c;
int j;
scanf("%lld%lld%lld",&n,&test,&c);
for(j=0; j<=n; j++)
a[j]=c;
while(test--)
{
char str[80]=" ";
fflush(stdin);
gets(str);
scan(str);
if(str[0]=='Q')
printf("%lld",a[result]);
else
{
for(j=result; j<=result1; j++)
{
a[j]+=result2;
}
}
}
return 0;
}
I am getting runtime error
I am getting runtime error again and again.
i am using segment tree.
the code is running fine on my system with even n=100000.
@sakuag333 ur getting runtime
Hi I am getting correct