Submission #2213338
Source Code Expand
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define FOR(i, a, b) for(i = a; i < b; ++i)
#define REP(i, n) FOR(i, 0, n)
#define comp(a, b) int comp(const void *a, const void *b)
#define MOD 1000000007
typedef unsigned int uint;
typedef unsigned long ulong;
typedef long long ll;
typedef unsigned long long ull;
void TF_print(char boolean, char T[], char F[]){
if(boolean){
printf("%s\n", T);
}else{
printf("%s\n", F);
}
}
comp(a, b){
ll d = *(ull*)a - *(ull*)b;
if(d > 0){
return 1;
}else if(d < 0){
return -1;
}else{
return 0;
}
}
int main(){
uint N;
scanf("%u", &N);
ull A[N], B[N], C[N];
uint i;
REP(i, N){
scanf("%llu", &A[i]);
}
REP(i, N){
scanf("%llu", &B[i]);
}
REP(i, N){
scanf("%llu", &C[i]);
}
qsort(A, N, sizeof(ull), comp);
qsort(B, N, sizeof(ull), comp);
qsort(C, N, sizeof(ull), comp);
uint a, b, c = 0;
ull ANS = 0;
REP(a, N){
REP(b, N){
if(A[a] < B[b]){
while(B[b] >= C[c]){
c++;
}
ANS += N - c;
c = 0;
}
}
}
printf("%llu\n", ANS);
return 0;
}
Submission Info
Submission Time
2018-03-17 00:26:41+0900
Task
C - Snuke Festival
User
kumachan_atcoder
Language
C (GCC 5.4.1)
Score
0
Code Size
1353 Byte
Status
TLE
Exec Time
2103 ms
Memory
3324 KB
Compile Error
./Main.c: In function ‘main’:
./Main.c:36:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%u", &N);
^
./Main.c:41:9: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%llu", &A[i]);
^
./Main.c:44:9: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%llu", &B[i]);
^
./Main.c:47:9: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%llu", &C[i]);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 300
Status
Set Name
Test Cases
Sample
s1.txt, s2.txt, s3.txt
All
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, s1.txt, s2.txt, s3.txt
Case Name
Status
Exec Time
Memory
01.txt
TLE
2103 ms
3324 KB
02.txt
TLE
2103 ms
3324 KB
03.txt
TLE
2103 ms
3324 KB
04.txt
TLE
2103 ms
3324 KB
05.txt
TLE
2103 ms
3324 KB
06.txt
TLE
2103 ms
3324 KB
07.txt
TLE
2103 ms
3324 KB
08.txt
TLE
2103 ms
3324 KB
09.txt
TLE
2103 ms
3220 KB
10.txt
TLE
2103 ms
3220 KB
11.txt
TLE
2103 ms
3120 KB
12.txt
TLE
2103 ms
3120 KB
13.txt
TLE
2103 ms
3324 KB
14.txt
TLE
2103 ms
3324 KB
15.txt
TLE
2103 ms
3324 KB
16.txt
TLE
2103 ms
3324 KB
17.txt
TLE
2103 ms
3324 KB
18.txt
TLE
2103 ms
3324 KB
19.txt
TLE
2103 ms
3324 KB
20.txt
TLE
2103 ms
2940 KB
21.txt
TLE
2103 ms
2940 KB
22.txt
TLE
2103 ms
2940 KB
23.txt
TLE
2103 ms
3324 KB
24.txt
TLE
2103 ms
3324 KB
25.txt
TLE
2103 ms
3324 KB
26.txt
AC
0 ms
128 KB
27.txt
AC
0 ms
128 KB
28.txt
AC
0 ms
128 KB
29.txt
AC
1 ms
128 KB
s1.txt
AC
0 ms
128 KB
s2.txt
AC
1 ms
128 KB
s3.txt
AC
1 ms
128 KB