Submission #3815792
Source Code Expand
#include <iostream> #include <string> #include<algorithm> #include <vector> #include<stack> #include<queue> #include<list> #include<set> #include<map> #include<numeric> #include<regex> using namespace std; typedef long long ll; #define modulo 1000000007 // 10^9 + 7 #define MAX 1000000000 // 10^9 int main() { int N; cin >> N; int A[N+1], B[N+1], C[N+1]; for (int i = 0; i < N; i++) cin >> A[i]; for (int i = 0; i < N; i++) cin >> B[i]; for (int i = 0; i < N; i++) cin >> C[i]; sort(A, A + N); sort(B, B + N); sort(C, C + N); A[N] = MAX; B[N] = MAX; // B[i] > A[j] を満たすjの数 int D[N]; int j = 0; for (int i = 0; i < N; i++) { while (B[i] > A[j]) j++; D[i] = j; } /* cout << " D[i] = "; for(int k = 0; k < N; k++) { cout << D[k] << " "; } cout << endl << " E[i] = "; */ j = 0; int E[N]; E[0] = 0; for (int i = 0; i < N; i++) { while (C[i] > B[j]) { E[i] += D[j]; j++; } E[i + 1] = E[i]; // cout << E[i] << " "; } // cout << endl; ll ans = 0; for (int i = 0; i < N; i++) { ans += E[i]; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Snuke Festival |
User | lapis_Lazuri |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1184 Byte |
Status | WA |
Exec Time | 180 ms |
Memory | 2176 KB |
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 | WA | 176 ms | 2176 KB |
02.txt | WA | 179 ms | 2176 KB |
03.txt | WA | 139 ms | 2176 KB |
04.txt | WA | 141 ms | 2176 KB |
05.txt | WA | 92 ms | 2176 KB |
06.txt | WA | 93 ms | 2176 KB |
07.txt | WA | 77 ms | 2176 KB |
08.txt | WA | 76 ms | 2176 KB |
09.txt | WA | 63 ms | 2176 KB |
10.txt | WA | 63 ms | 2176 KB |
11.txt | AC | 59 ms | 2176 KB |
12.txt | AC | 59 ms | 2176 KB |
13.txt | WA | 179 ms | 2176 KB |
14.txt | AC | 175 ms | 2176 KB |
15.txt | AC | 177 ms | 2176 KB |
16.txt | AC | 175 ms | 2176 KB |
17.txt | AC | 177 ms | 2176 KB |
18.txt | AC | 175 ms | 2176 KB |
19.txt | WA | 177 ms | 2176 KB |
20.txt | WA | 61 ms | 2176 KB |
21.txt | AC | 57 ms | 2176 KB |
22.txt | AC | 177 ms | 2176 KB |
23.txt | WA | 180 ms | 2176 KB |
24.txt | WA | 177 ms | 2176 KB |
25.txt | AC | 173 ms | 2176 KB |
26.txt | AC | 1 ms | 256 KB |
27.txt | AC | 1 ms | 256 KB |
28.txt | AC | 1 ms | 256 KB |
29.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |