Submission #16509


Source Code Expand

#include "training.h"

#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

int n,a[5000];

void init(int n,int a[]){
	::n=n;
	rep(i,n) ::a[i]=a[i];
}

void update(int i,int x){
	a[i]=x;
}

int train(int l,int r){
	r++;
	int res=0;
	for(int i=l;i<r;i++) for(int j=l;j<i;j++) if(a[j]>a[i]) res++;
	return res;
}

Submission Info

Submission Time
Task C - 魔法の訓練 (Magical Training)
User fura2
Language IOI-Style C++ (GCC 5.4.1)
Score 12
Code Size 344 Byte
Status TLE
Exec Time 4035 ms
Memory 1612 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 0 / 18 0 / 30 0 / 40
Status
AC × 10
AC × 2
TLE × 7
AC × 1
TLE × 6
AC × 4
TLE × 6
RE × 2
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 1020 KB
subtask1/10 AC 25 ms 1044 KB
subtask1/2 AC 23 ms 980 KB
subtask1/3 AC 23 ms 1000 KB
subtask1/4 AC 25 ms 1044 KB
subtask1/5 AC 26 ms 1004 KB
subtask1/6 AC 25 ms 1040 KB
subtask1/7 AC 25 ms 944 KB
subtask1/8 AC 24 ms 1004 KB
subtask1/9 AC 24 ms 1044 KB
subtask2/1 AC 728 ms 1212 KB
subtask2/2 TLE 4030 ms 1096 KB
subtask2/3 TLE 4035 ms 1084 KB
subtask2/4 TLE 4030 ms 1216 KB
subtask2/5 TLE 4030 ms 1052 KB
subtask2/6 TLE 4030 ms 1092 KB
subtask2/7 TLE 4030 ms 1096 KB
subtask2/8 AC 129 ms 1208 KB
subtask2/9 TLE 4030 ms 1064 KB
subtask3/1 TLE 4030 ms 1108 KB
subtask3/2 TLE 4030 ms 1188 KB
subtask3/3 TLE 4030 ms 1228 KB
subtask3/4 TLE 4030 ms 1296 KB
subtask3/5 AC 788 ms 1612 KB
subtask3/6 TLE 4030 ms 1324 KB
subtask3/7 TLE 4030 ms 1252 KB
subtask4/1 AC 444 ms 1348 KB
subtask4/10 AC 671 ms 1492 KB
subtask4/11 AC 431 ms 1460 KB
subtask4/12 TLE 4030 ms 1328 KB
subtask4/2 TLE 4030 ms 1320 KB
subtask4/3 RE 0 ms 1276 KB
subtask4/4 TLE 4030 ms 1208 KB
subtask4/5 TLE 4030 ms 1316 KB
subtask4/6 AC 769 ms 1504 KB
subtask4/7 TLE 4030 ms 1332 KB
subtask4/8 TLE 4030 ms 1232 KB
subtask4/9 RE 0 ms 1236 KB