Submission #16516
Source Code Expand
#include"training.h"
#include<cstdio>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
const int N_MAX=5000;
template<class T>
class Fenwick_tree{
int n;
T a[N_MAX];
public:
void build(int n){
this->n=n;
rep(i,n) a[i]=0;
}
void add(int i,T v){
for(;i<n;i|=i+1) a[i]+=v;
}
T sum(int i,int j){
if(i==0){
T s=0;
for(;j>=0;j=(j&(j+1))-1) s+=a[j];
return s;
}
return sum(0,j)-sum(0,i-1);
}
};
int n,a[5000];
void init(int n,int a[]){
::n=n;
rep(i,n) ::a[i]=a[i]-1;
}
void update(int i,int x){
x--;
a[i]=x;
}
Fenwick_tree<int> F;
int train(int l,int r){
r++;
F.build(n);
int res=0;
for(int i=l;i<r;i++){
F.add(a[i],1);
res+=F.sum(a[i]+1,n-1);
}
return res;
}
Submission Info
Submission Time
2012-05-20 13:58:27+0900
Task
C - 魔法の訓練 (Magical Training)
User
fura2
Language
IOI-Style C++ (GCC 5.4.1)
Score
30
Code Size
778 Byte
Status
WA
Exec Time
4035 ms
Memory
1500 KB
Compile Error
./grader.cpp: In function ‘int main()’:
./grader.cpp:11: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result
./grader.cpp:13: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result
./grader.cpp:14: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result
./grader.cpp:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result
Judge Result
Set Name
Subtask1
Subtask2
Subtask3
Subtask4
Score / Max Score
12 / 12
18 / 18
0 / 30
0 / 40
Status
Set Name
Test Cases
Subtask1
subtask1/1, subtask1/10, subtask1/2, subtask1/3, subtask1/4, subtask1/5, subtask1/6, subtask1/7, subtask1/8, subtask1/9
Subtask2
subtask2/1, subtask2/2, subtask2/3, subtask2/4, subtask2/5, subtask2/6, subtask2/7, subtask2/8, subtask2/9
Subtask3
subtask3/1, subtask3/2, subtask3/3, subtask3/4, subtask3/5, subtask3/6, subtask3/7
Subtask4
subtask4/1, subtask4/10, subtask4/11, subtask4/12, subtask4/2, subtask4/3, subtask4/4, subtask4/5, subtask4/6, subtask4/7, subtask4/8, subtask4/9
Case Name
Status
Exec Time
Memory
subtask1/1
AC
24 ms
984 KB
subtask1/10
AC
26 ms
1032 KB
subtask1/2
AC
24 ms
1104 KB
subtask1/3
AC
23 ms
988 KB
subtask1/4
AC
28 ms
992 KB
subtask1/5
AC
25 ms
1000 KB
subtask1/6
AC
24 ms
992 KB
subtask1/7
AC
26 ms
1044 KB
subtask1/8
AC
25 ms
1012 KB
subtask1/9
AC
25 ms
976 KB
subtask2/1
AC
161 ms
1112 KB
subtask2/2
AC
522 ms
1192 KB
subtask2/3
AC
1115 ms
1204 KB
subtask2/4
AC
261 ms
1212 KB
subtask2/5
AC
871 ms
1172 KB
subtask2/6
AC
2868 ms
1240 KB
subtask2/7
AC
1443 ms
1184 KB
subtask2/8
AC
164 ms
1208 KB
subtask2/9
AC
909 ms
1224 KB
subtask3/1
RE
335 ms
1108 KB
subtask3/2
RE
46 ms
1272 KB
subtask3/3
TLE
4035 ms
1456 KB
subtask3/4
TLE
4030 ms
1376 KB
subtask3/5
RE
32 ms
1232 KB
subtask3/6
TLE
4030 ms
1500 KB
subtask3/7
RE
1560 ms
1264 KB
subtask4/1
WA
50 ms
1488 KB
subtask4/10
RE
43 ms
1256 KB
subtask4/11
RE
45 ms
1228 KB
subtask4/12
WA
1443 ms
1484 KB
subtask4/2
RE
244 ms
1280 KB
subtask4/3
RE
1986 ms
1472 KB
subtask4/4
RE
1205 ms
1360 KB
subtask4/5
RE
0 ms
1340 KB
subtask4/6
RE
78 ms
1276 KB
subtask4/7
TLE
4030 ms
1388 KB
subtask4/8
TLE
4030 ms
1396 KB
subtask4/9
WA
955 ms
1488 KB