group_id
stringlengths 12
18
| problem_description
stringlengths 85
3.02k
| candidates
listlengths 3
20
|
|---|---|---|
aoj_ALDS1_1_B_cpp
|
Greatest Common Divisor
Write a program which finds the greatest common divisor of two natural numbers
a
and
b
Input
a
and
b
are given in a line sparated by a single space.
Output
Output the greatest common divisor of
a
and
b
.
Constrants
1 โค
a
,
b
โค 10
9
Hint
You can use the following observation:
For integers
x
and
y
, if
x
โฅ
y
, then gcd(
x
,
y
) = gcd(
y
,
x
%
y
)
Sample Input 1
54 20
Sample Output 1
2
Sample Input 2
147 105
Sample Output 2
21
|
[
{
"submission_id": "aoj_ALDS1_1_B_10915851",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main(){\n int x, y; cin >> x >> y;\n int d = 2;\n int gcd = 1;\n\n while(d <= x && d <= y){\n if (x % d == 0 && y % d == 0){\n x = x / d;\n y = y / d;\n gcd = gcd * d;\n }\n else d++;\n }\n cout << gcd << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 260,
"memory_kb": 3432,
"score_of_the_acc": -2,
"final_rank": 3
},
{
"submission_id": "aoj_ALDS1_1_B_10912277",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main(){\n int x, y, ans, temp, i;\n cin >> x >> y;\n if(x < y){\n temp = x;\n x = y;\n y = temp;\n }\n\n if(x == y) ans = x;\n else{\n x %= y;\n for(i = x; i >= 1; i--){\n if(x%i == 0 and y%i == 0){\n ans = i;\n break;\n }\n }\n }\n\n cout << ans << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 260,
"memory_kb": 3432,
"score_of_the_acc": -2,
"final_rank": 3
},
{
"submission_id": "aoj_ALDS1_1_B_10892907",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main(){\n int x, y, remain, ans, i;\n cin >> x >> y;\n \n if(x >= y){\n remain = x%y;\n if(remain == 0){\n ans = y;\n }\n else{\n for(i = remain-1; i >= 1; i--){\n if(remain%i == 0 and y%i == 0){\n ans = i;\n break;\n }\n }\n }\n }\n else{\n remain = y%x;\n if(remain == 0){\n ans = x;\n }\n else{\n for(i = remain-1; i >= 1; i--){\n if(remain%i == 0 and x%i == 0){\n ans = i;\n break;\n }\n }\n }\n }\n cout << ans << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 260,
"memory_kb": 3420,
"score_of_the_acc": -1,
"final_rank": 2
},
{
"submission_id": "aoj_ALDS1_1_B_10881531",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main(){\n int x, y, z, min, divisible, i;\n cin >> x >> y;\n\n if(x >= y){\n z = x % y;\n if(z == 0) divisible = y;\n else{\n if(y > z) min = z;\n else min = y;\n for(i = min; i >= 1; i--){\n if(y % i == 0 and z % i == 0){\n divisible = i;\n break;\n }\n }\n }\n cout << divisible << endl;\n }\n\n else{\n z = y % x;\n if(z == 0) divisible = y;\n else{\n if(x > z) min = z;\n else min = x;\n for(i = min; i >= 1; i--){\n if(x % i == 0 and z % i == 0){\n divisible = i;\n break;\n }\n }\n }\n cout << divisible << endl;\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 250,
"memory_kb": 3424,
"score_of_the_acc": -0.3333,
"final_rank": 1
}
] |
aoj_ALDS1_2_D_cpp
|
Shell Sort
Shell Sort is a generalization of Insertion Sort (ALDS1_1_A) to arrange a list of $n$ elements $A$.
1 insertionSort(A, n, g)
2 for i = g to n-1
3 v = A[i]
4 j = i - g
5 while j >= 0 && A[j] > v
6 A[j+g] = A[j]
7 j = j - g
8 cnt++
9 A[j+g] = v
10
11 shellSort(A, n)
12 cnt = 0
13 m = ?
14 G[] = {?, ?,..., ?}
15 for i = 0 to m-1
16 insertionSort(A, n, G[i])
A function shellSort(A, n) performs a function insertionSort(A, n, g), which considers every $g$-th elements. Beginning with large values of $g$, it repeats the insertion sort with smaller $g$.
Your task is to complete the above program by filling
?
. Write a program which reads an integer $n$ and a sequence $A$, and prints $m$, $G_i (i = 0, 1, ..., m โ 1)$ in the pseudo code and the sequence $A$ in ascending order. The output of your program must meet the following requirements:
$1 \leq m \leq 100$
$0 \leq G_i \leq n$
cnt
does not exceed $\lceil n^{1.5}\rceil$
Input
In the first line, an integer $n$ is given. In the following $n$ lines, $A_i (i=0,1,...,n-1)$ are given for each line.
Output
In the first line, print an integer $m$. In the second line, print $m$ integers $G_i (i=0,1,...,m-1)$ separated by single space character in a line.
In the third line, print
cnt
in a line. In the following $n$ lines, print $A_i (i=0,1,...,n-1)$ respectively.
This problem has multiple solutions and the judge will be performed by a special validator.
Constraints
$1 \leq n \leq 1,000,000$
$0 \leq A_i \leq 10^9$
Sample Input 1
5
5
1
4
3
2
Sample Output 1
2
4 1
3
1
2
3
4
5
Sample Input 2
3
3
2
1
Sample Output 2
1
1
3
1
2
3
|
[
{
"submission_id": "aoj_ALDS1_2_D_11015424",
"code_snippet": "#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass my_vector\n{\nprivate: // ้ ใใใฎใๅคใใ่ฆใใชใ\n int *a; // ๅฏๅค้ท้
ๅ\n int n; // ่ฆ็ด ๆฐ\n int capacity; // ็ขบไฟใใๅฎน้\n\npublic: // ๅ
ฌ้ใใใใฎ\n my_vector() // vectorๅฎ็พฉใๅผๆฐ็กใใๅๆๅ\n {\n a = new int[0];\n n = 0;\n capacity = 0;\n } // vector<int> a;\n\n my_vector(int size) // vectorๅฎ็พฉใ่ฆ็ด ใใ\n {\n a = new int[size];\n n = size;\n capacity = size;\n } // vector<int> a(n);\n\n void reserve(int reserved_size) // reserve ใกใขใชใฎไบๅ็ขบไฟ\n {\n int *reserved_a = new int[reserved_size];\n for (int i = 0; i < n; i++)\n {\n reserved_a[i] = a[i];\n }\n\n delete[] a;\n a = reserved_a;\n capacity = reserved_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void resize(int resized_size) // ใชใตใคใบ้ขๆฐ\n {\n int *resized_a = new int[resized_size]; // aใฎใตใคใบใๅคๆด\n\n int copysize = min(resized_size, n);\n\n for (int i = 0; i < copysize; i++)\n {\n resized_a[i] = a[i];\n }\n\n delete[] a;\n a = resized_a;\n n = resized_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void push_back(int newvalue) // push_back้ขๆฐ\n {\n if (n == capacity) // ๅฎน้ไธๆฏ\n {\n int reserve_capacity;\n if (capacity == 0)\n {\n reserve_capacity = 1;\n }\n else\n {\n reserve_capacity = capacity * 2 ;\n }\n reserve(reserve_capacity);\n }\n a[n] = newvalue;\n n++;\n }\n\n int size() const // ใตใคใบๅๅพ\n {\n return n;\n }\n\n int &operator[](int soeji) //\n {\n return a[soeji];\n }\n};\n\nint main()\n{\n int n;\n cin >> n;\n\n my_vector card;\n for (int i = 0; i < n; ++i)\n {\n int x;\n cin >> x;\n card.push_back(x);\n }\n\n // ใทใงใซใฝใผใ\n int cnt = 0;\n int m = 1 + log2(n);\n cout << m << \"\\n\";\n\n for (int g = n; g > 0; g /= 2) // ๆฟๅ
ฅใฝใผใใใใใใณgใฎๅคใๅๅใซใใ\n {\n for (int i = g; i < n; i++) // card[g]ใใฝใผใ\n {\n int v = card[i]; // ใฝใผใใใใซใผใ\n int j = i - g; // ๆฏ่ผใใใซใผใ\n while (j >= 0 && card[j] > v) // ๆฏ่ผใใใซใผใ๏ผใฝใผใใใใซใผใ\n {\n card[j + g] = card[j]; // ใซใผใใๅ
ฅใๆฟใใ\n j = j - g;\n cnt++;\n }\n card[j + g] = v;\n }\n cout << g << \" \";\n }\n cout << \"\\n\";\n\n cout << cnt << \"\\n\";\n\n for (int i = 0; i < n; i++)\n {\n cout << card[i] << \"\\n\"; // ใซใผใ่กจ็คบ\n }\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 8664,
"score_of_the_acc": -0.6225,
"final_rank": 16
},
{
"submission_id": "aoj_ALDS1_2_D_11015398",
"code_snippet": "#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass my_vector\n{\nprivate: // ้ ใใใฎใๅคใใ่ฆใใชใ\n int *a; // ๅฏๅค้ท้
ๅ\n int n; // ่ฆ็ด ๆฐ\n int capacity; // ็ขบไฟใใๅฎน้\n\npublic: // ๅ
ฌ้ใใใใฎ\n my_vector() // vectorๅฎ็พฉใๅผๆฐ็กใใๅๆๅ\n {\n a = new int[0];\n n = 0;\n capacity = 0;\n } // vector<int> a;\n\n my_vector(int size) // vectorๅฎ็พฉใ่ฆ็ด ใใ\n {\n a = new int[size];\n n = size;\n capacity = size;\n } // vector<int> a(n);\n\n void reserve(int reserved_size) // reserve ใกใขใชใฎไบๅ็ขบไฟ\n {\n int *reserved_a = new int[reserved_size];\n for (int i = 0; i < n; i++)\n {\n reserved_a[i] = a[i];\n }\n\n delete[] a;\n a = reserved_a;\n capacity = reserved_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void resize(int resized_size) // ใชใตใคใบ้ขๆฐ\n {\n int *resized_a = new int[resized_size]; // aใฎใตใคใบใๅคๆด\n\n int copysize = min(resized_size, n);\n\n for (int i = 0; i < copysize; i++)\n {\n resized_a[i] = a[i];\n }\n\n delete[] a;\n a = resized_a;\n n = resized_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void push_back(int newvalue) // push_back้ขๆฐ\n {\n if (n == capacity) // ๅฎน้ไธๆฏ\n {\n int reserve_capacity;\n if (capacity == 0)\n {\n reserve_capacity = 1;\n }\n else\n {\n reserve_capacity = capacity *5 ;\n }\n reserve(reserve_capacity);\n }\n a[n] = newvalue;\n n++;\n }\n\n int size() const // ใตใคใบๅๅพ\n {\n return n;\n }\n\n int &operator[](int soeji) //\n {\n return a[soeji];\n }\n};\n\nint main()\n{\n int n;\n cin >> n;\n\n my_vector card;\n for (int i = 0; i < n; ++i)\n {\n int x;\n cin >> x;\n card.push_back(x);\n }\n\n // ใทใงใซใฝใผใ\n int cnt = 0;\n int m = 1 + log2(n);\n cout << m << \"\\n\";\n\n for (int g = n; g > 0; g /= 2) // ๆฟๅ
ฅใฝใผใใใใใใณgใฎๅคใๅๅใซใใ\n {\n for (int i = g; i < n; i++) // card[g]ใใฝใผใ\n {\n int v = card[i]; // ใฝใผใใใใซใผใ\n int j = i - g; // ๆฏ่ผใใใซใผใ\n while (j >= 0 && card[j] > v) // ๆฏ่ผใใใซใผใ๏ผใฝใผใใใใซใผใ\n {\n card[j + g] = card[j]; // ใซใผใใๅ
ฅใๆฟใใ\n j = j - g;\n cnt++;\n }\n card[j + g] = v;\n }\n cout << g << \" \";\n }\n cout << \"\\n\";\n\n cout << cnt << \"\\n\";\n\n for (int i = 0; i < n; i++)\n {\n cout << card[i] << \"\\n\"; // ใซใผใ่กจ็คบ\n }\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 8804,
"score_of_the_acc": -0.6584,
"final_rank": 18
},
{
"submission_id": "aoj_ALDS1_2_D_11015395",
"code_snippet": "#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass my_vector\n{\nprivate: // ้ ใใใฎใๅคใใ่ฆใใชใ\n int *a; // ๅฏๅค้ท้
ๅ\n int n; // ่ฆ็ด ๆฐ\n int capacity; // ็ขบไฟใใๅฎน้\n\npublic: // ๅ
ฌ้ใใใใฎ\n my_vector() // vectorๅฎ็พฉใๅผๆฐ็กใใๅๆๅ\n {\n a = new int[0];\n n = 0;\n capacity = 0;\n } // vector<int> a;\n\n my_vector(int size) // vectorๅฎ็พฉใ่ฆ็ด ใใ\n {\n a = new int[size];\n n = size;\n capacity = size;\n } // vector<int> a(n);\n\n void reserve(int reserved_size) // reserve ใกใขใชใฎไบๅ็ขบไฟ\n {\n int *reserved_a = new int[reserved_size];\n for (int i = 0; i < n; i++)\n {\n reserved_a[i] = a[i];\n }\n\n delete[] a;\n a = reserved_a;\n capacity = reserved_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void resize(int resized_size) // ใชใตใคใบ้ขๆฐ\n {\n int *resized_a = new int[resized_size]; // aใฎใตใคใบใๅคๆด\n\n int copysize = min(resized_size, n);\n\n for (int i = 0; i < copysize; i++)\n {\n resized_a[i] = a[i];\n }\n\n delete[] a;\n a = resized_a;\n n = resized_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void push_back(int newvalue) // push_back้ขๆฐ\n {\n if (n == capacity) // ๅฎน้ไธๆฏ\n {\n int reserve_capacity;\n if (capacity == 0)\n {\n reserve_capacity = 1;\n }\n else\n {\n reserve_capacity = capacity * 2;\n }\n reserve(reserve_capacity);\n }\n a[n] = newvalue;\n n++;\n }\n\n int size() const // ใตใคใบๅๅพ\n {\n return n;\n }\n\n int &operator[](int soeji) //\n {\n return a[soeji];\n }\n};\n\nint main()\n{\n int n;\n cin >> n;\n\n my_vector card;\n for (int i = 0; i < n; ++i)\n {\n int x;\n cin >> x;\n card.push_back(x);\n }\n\n // ใทใงใซใฝใผใ\n int cnt = 0;\n int m = 1 + log2(n);\n cout << m << \"\\n\";\n\n for (int g = n; g > 0; g /= 2) // ๆฟๅ
ฅใฝใผใใใใใใณgใฎๅคใๅๅใซใใ\n {\n for (int i = g; i < n; i++) // card[g]ใใฝใผใ\n {\n int v = card[i]; // ใฝใผใใใใซใผใ\n int j = i - g; // ๆฏ่ผใใใซใผใ\n while (j >= 0 && card[j] > v) // ๆฏ่ผใใใซใผใ๏ผใฝใผใใใใซใผใ\n {\n card[j + g] = card[j]; // ใซใผใใๅ
ฅใๆฟใใ\n j = j - g;\n cnt++;\n }\n card[j + g] = v;\n }\n cout << g << \" \";\n }\n cout << \"\\n\";\n\n cout << cnt << \"\\n\";\n\n for (int i = 0; i < n; i++)\n {\n cout << card[i] << \"\\n\"; // ใซใผใ่กจ็คบ\n }\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 8664,
"score_of_the_acc": -0.6225,
"final_rank": 16
},
{
"submission_id": "aoj_ALDS1_2_D_11001403",
"code_snippet": "#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass my_vector\n{\nprivate: // ้ ใใใฎใๅคใใ่ฆใใชใ\n int *a; // ๅฏๅค้ท้
ๅ\n int n; // ่ฆ็ด ๆฐ\n int capacity; // ็ขบไฟใใๅฎน้\n\npublic: // ๅ
ฌ้ใใใใฎ\n my_vector() // vectorๅฎ็พฉใๅผๆฐ็กใใๅๆๅ\n {\n a = new int[0];\n n = 0;\n capacity = 0;\n } // vector<int> a;\n\n my_vector(int size) // vectorๅฎ็พฉใ่ฆ็ด ใใ\n {\n a = new int[size];\n n = size;\n capacity = size;\n } // vector<int> a(n);\n\n void reserve(int reserved_size) // reserve ใกใขใชใฎไบๅ็ขบไฟ\n {\n int *reserved_a = new int[reserved_size];\n for (int i = 0; i < n; i++)\n {\n reserved_a[i] = a[i];\n }\n\n delete[] a;\n a = reserved_a;\n capacity = reserved_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void resize(int resized_size) // ใชใตใคใบ้ขๆฐ\n {\n int *resized_a = new int[resized_size]; // aใฎใตใคใบใๅคๆด\n\n int copysize = min(resized_size, n);\n\n for (int i = 0; i < copysize; i++)\n {\n resized_a[i] = a[i];\n }\n\n delete[] a;\n a = resized_a;\n n = resized_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void push_back(int newvalue) // push_back้ขๆฐ\n {\n if (n == capacity) // ๅฎน้ไธๆฏ\n {\n int new_capacity;\n if (capacity == 0)\n {\n new_capacity = 1;\n }\n else\n {\n new_capacity *1;\n }\n reserve(new_capacity);\n }\n a[n] = newvalue;\n n++;\n }\n\n int size() const // ใตใคใบๅๅพ\n {\n return n;\n }\n\n int &operator[](int soeji) //\n {\n return a[soeji];\n }\n};\n\nint main()\n{\n int n;\n cin >> n;\n\n my_vector card;\n card.reserve(n);\n for (int i = 0; i < n; ++i)\n {\n int x;\n cin >> x;\n card.push_back(x);\n }\n\n // ใทใงใซใฝใผใ\n int cnt = 0;\n int m = 1 + log2(n);\n cout << m << \"\\n\";\n\n for (int g = n; g > 0; g /= 2) // ๆฟๅ
ฅใฝใผใใใใใใณgใฎๅคใๅๅใซใใ\n {\n for (int i = g; i < n; i++) // card[g]ใใฝใผใ\n {\n int v = card[i]; // ใฝใผใใใใซใผใ\n int j = i - g; // ๆฏ่ผใใใซใผใ\n while (j >= 0 && card[j] > v) // ๆฏ่ผใใใซใผใ๏ผใฝใผใใใใซใผใ\n {\n card[j + g] = card[j]; // ใซใผใใๅ
ฅใๆฟใใ\n j = j - g;\n cnt++;\n }\n card[j + g] = v;\n }\n cout << g << \" \";\n }\n cout << \"\\n\";\n\n cout << cnt << \"\\n\";\n\n for (int i = 0; i < n; i++)\n {\n cout << card[i] << \"\\n\"; // ใซใผใ่กจ็คบ\n }\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 7568,
"score_of_the_acc": -0.3411,
"final_rank": 5
},
{
"submission_id": "aoj_ALDS1_2_D_11001398",
"code_snippet": "#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass my_vector\n{\nprivate: // ้ ใใใฎใๅคใใ่ฆใใชใ\n int *a; // ๅฏๅค้ท้
ๅ\n int n; // ่ฆ็ด ๆฐ\n int capacity; // ็ขบไฟใใๅฎน้\n\npublic: // ๅ
ฌ้ใใใใฎ\n my_vector() // vectorๅฎ็พฉใๅผๆฐ็กใใๅๆๅ\n {\n a = new int[0];\n n = 0;\n capacity = 0;\n } // vector<int> a;\n\n my_vector(int size) // vectorๅฎ็พฉใ่ฆ็ด ใใ\n {\n a = new int[size];\n n = size;\n capacity = size;\n } // vector<int> a(n);\n\n void reserve(int reserved_size) // reserve ใกใขใชใฎไบๅ็ขบไฟ\n {\n int *reserved_a = new int[reserved_size];\n for (int i = 0; i < n; i++)\n {\n reserved_a[i] = a[i];\n }\n\n delete[] a;\n a = reserved_a;\n capacity = reserved_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void resize(int resized_size) // ใชใตใคใบ้ขๆฐ\n {\n int *resized_a = new int[resized_size]; // aใฎใตใคใบใๅคๆด\n\n int copysize = min(resized_size, n);\n\n for (int i = 0; i < copysize; i++)\n {\n resized_a[i] = a[i];\n }\n\n delete[] a;\n a = resized_a;\n n = resized_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void push_back(int newvalue) // push_back้ขๆฐ\n {\n if (n == capacity) // ๅฎน้ไธๆฏ\n {\n int new_capacity;\n if (capacity == 0)\n {\n new_capacity = 1;\n }\n else\n {\n new_capacity * 2;\n }\n reserve(new_capacity);\n }\n a[n] = newvalue;\n n++;\n }\n\n int size() const // ใตใคใบๅๅพ\n {\n return n;\n }\n\n int &operator[](int soeji) //\n {\n return a[soeji];\n }\n};\n\nint main()\n{\n int n;\n cin >> n;\n\n my_vector card;\n card.reserve(n);\n for (int i = 0; i < n; ++i)\n {\n int x;\n cin >> x;\n card.push_back(x);\n }\n\n // ใทใงใซใฝใผใ\n int cnt = 0;\n int m = 1 + log2(n);\n cout << m << \"\\n\";\n\n for (int g = n; g > 0; g /= 2) // ๆฟๅ
ฅใฝใผใใใใใใณgใฎๅคใๅๅใซใใ\n {\n for (int i = g; i < n; i++) // card[g]ใใฝใผใ\n {\n int v = card[i]; // ใฝใผใใใใซใผใ\n int j = i - g; // ๆฏ่ผใใใซใผใ\n while (j >= 0 && card[j] > v) // ๆฏ่ผใใใซใผใ๏ผใฝใผใใใใซใผใ\n {\n card[j + g] = card[j]; // ใซใผใใๅ
ฅใๆฟใใ\n j = j - g;\n cnt++;\n }\n card[j + g] = v;\n }\n cout << g << \" \";\n }\n cout << \"\\n\";\n\n cout << cnt << \"\\n\";\n\n for (int i = 0; i < n; i++)\n {\n cout << card[i] << \"\\n\"; // ใซใผใ่กจ็คบ\n }\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 7568,
"score_of_the_acc": -0.3411,
"final_rank": 5
},
{
"submission_id": "aoj_ALDS1_2_D_11001395",
"code_snippet": "#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass my_vector\n{\nprivate: // ้ ใใใฎใๅคใใ่ฆใใชใ\n int *a; // ๅฏๅค้ท้
ๅ\n int n; // ่ฆ็ด ๆฐ\n int capacity; // ็ขบไฟใใๅฎน้\n\npublic: // ๅ
ฌ้ใใใใฎ\n my_vector() // vectorๅฎ็พฉใๅผๆฐ็กใใๅๆๅ\n {\n a = new int[0];\n n = 0;\n capacity = 0;\n } // vector<int> a;\n\n my_vector(int size) // vectorๅฎ็พฉใ่ฆ็ด ใใ\n {\n a = new int[size];\n n = size;\n capacity = size;\n } // vector<int> a(n);\n\n void reserve(int reserved_size) // reserve ใกใขใชใฎไบๅ็ขบไฟ\n {\n int *reserved_a = new int[reserved_size];\n for (int i = 0; i < n; i++)\n {\n reserved_a[i] = a[i];\n }\n\n delete[] a;\n a = reserved_a;\n capacity = reserved_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void resize(int resized_size) // ใชใตใคใบ้ขๆฐ\n {\n int *resized_a = new int[resized_size]; // aใฎใตใคใบใๅคๆด\n\n int copysize = min(resized_size, n);\n\n for (int i = 0; i < copysize; i++)\n {\n resized_a[i] = a[i];\n }\n\n delete[] a;\n a = resized_a;\n n = resized_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void push_back(int newvalue) // push_back้ขๆฐ\n {\n if (n == capacity) // ๅฎน้ไธๆฏ\n {\n int new_capacity;\n if (capacity == 0)\n {\n new_capacity = 1;\n }\n else\n {\n new_capacity + 10;\n }\n reserve(new_capacity);\n }\n a[n] = newvalue;\n n++;\n }\n\n int size() const // ใตใคใบๅๅพ\n {\n return n;\n }\n\n int &operator[](int soeji) //\n {\n return a[soeji];\n }\n};\n\nint main()\n{\n int n;\n cin >> n;\n\n my_vector card;\n card.reserve(n);\n for (int i = 0; i < n; ++i)\n {\n int x;\n cin >> x;\n card.push_back(x);\n }\n\n // ใทใงใซใฝใผใ\n int cnt = 0;\n int m = 1 + log2(n);\n cout << m << \"\\n\";\n\n for (int g = n; g > 0; g /= 2) // ๆฟๅ
ฅใฝใผใใใใใใณgใฎๅคใๅๅใซใใ\n {\n for (int i = g; i < n; i++) // card[g]ใใฝใผใ\n {\n int v = card[i]; // ใฝใผใใใใซใผใ\n int j = i - g; // ๆฏ่ผใใใซใผใ\n while (j >= 0 && card[j] > v) // ๆฏ่ผใใใซใผใ๏ผใฝใผใใใใซใผใ\n {\n card[j + g] = card[j]; // ใซใผใใๅ
ฅใๆฟใใ\n j = j - g;\n cnt++;\n }\n card[j + g] = v;\n }\n cout << g << \" \";\n }\n cout << \"\\n\";\n\n cout << cnt << \"\\n\";\n\n for (int i = 0; i < n; i++)\n {\n cout << card[i] << \"\\n\"; // ใซใผใ่กจ็คบ\n }\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 7568,
"score_of_the_acc": -0.3411,
"final_rank": 5
},
{
"submission_id": "aoj_ALDS1_2_D_11001391",
"code_snippet": "#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass my_vector\n{\nprivate: // ้ ใใใฎใๅคใใ่ฆใใชใ\n int *a; // ๅฏๅค้ท้
ๅ\n int n; // ่ฆ็ด ๆฐ\n int capacity; // ็ขบไฟใใๅฎน้\n\npublic: // ๅ
ฌ้ใใใใฎ\n my_vector() // vectorๅฎ็พฉใๅผๆฐ็กใใๅๆๅ\n {\n a = new int[0];\n n = 0;\n capacity = 0;\n } // vector<int> a;\n\n my_vector(int size) // vectorๅฎ็พฉใ่ฆ็ด ใใ\n {\n a = new int[size];\n n = size;\n capacity = size;\n } // vector<int> a(n);\n\n void reserve(int reserved_size) // reserve ใกใขใชใฎไบๅ็ขบไฟ\n {\n int *reserved_a = new int[reserved_size];\n for (int i = 0; i < n; i++)\n {\n reserved_a[i] = a[i];\n }\n\n delete[] a;\n a = reserved_a;\n capacity = reserved_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void resize(int resized_size) // ใชใตใคใบ้ขๆฐ\n {\n int *resized_a = new int[resized_size]; // aใฎใตใคใบใๅคๆด\n\n int copysize = min(resized_size, n);\n\n for (int i = 0; i < copysize; i++)\n {\n resized_a[i] = a[i];\n }\n\n delete[] a;\n a = resized_a;\n n = resized_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void push_back(int newvalue) // push_back้ขๆฐ\n {\n if (n == capacity) // ๅฎน้ไธๆฏ\n {\n int new_capacity;\n if (capacity == 0)\n {\n new_capacity = 1;\n }\n else\n {\n new_capacity +1;\n }\n reserve(new_capacity);\n }\n a[n] = newvalue;\n n++;\n }\n\n int size() const // ใตใคใบๅๅพ\n {\n return n;\n }\n\n int &operator[](int soeji) //\n {\n return a[soeji];\n }\n};\n\nint main()\n{\n int n;\n cin >> n;\n\n my_vector card;\n card.reserve(n);\n for (int i = 0; i < n; ++i)\n {\n int x;\n cin >> x;\n card.push_back(x);\n }\n\n // ใทใงใซใฝใผใ\n int cnt = 0;\n int m = 1 + log2(n);\n cout << m << \"\\n\";\n\n for (int g = n; g > 0; g /= 2) // ๆฟๅ
ฅใฝใผใใใใใใณgใฎๅคใๅๅใซใใ\n {\n for (int i = g; i < n; i++) // card[g]ใใฝใผใ\n {\n int v = card[i]; // ใฝใผใใใใซใผใ\n int j = i - g; // ๆฏ่ผใใใซใผใ\n while (j >= 0 && card[j] > v) // ๆฏ่ผใใใซใผใ๏ผใฝใผใใใใซใผใ\n {\n card[j + g] = card[j]; // ใซใผใใๅ
ฅใๆฟใใ\n j = j - g;\n cnt++;\n }\n card[j + g] = v;\n }\n cout << g << \" \";\n }\n cout << \"\\n\";\n\n cout << cnt << \"\\n\";\n\n for (int i = 0; i < n; i++)\n {\n cout << card[i] << \"\\n\"; // ใซใผใ่กจ็คบ\n }\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 7568,
"score_of_the_acc": -0.3411,
"final_rank": 5
},
{
"submission_id": "aoj_ALDS1_2_D_11001361",
"code_snippet": "#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass my_vector\n{\nprivate: // ้ ใใใฎใๅคใใ่ฆใใชใ\n int *a; // ๅฏๅค้ท้
ๅ\n int n; // ่ฆ็ด ๆฐ\n int capacity; // ็ขบไฟใใๅฎน้\n\npublic: // ๅ
ฌ้ใใใใฎ\n my_vector() // vectorๅฎ็พฉใๅผๆฐ็กใใๅๆๅ\n {\n a = new int[0];\n n = 0;\n capacity = 0;\n } // vector<int> a;\n\n my_vector(int size) // vectorๅฎ็พฉใ่ฆ็ด ใใ\n {\n a = new int[size];\n n = size;\n capacity = size;\n } // vector<int> a(n);\n\n void reserve(int reserved_size) // reserve ใกใขใชใฎไบๅ็ขบไฟ\n {\n int *reserved_a = new int[reserved_size];\n for (int i = 0; i < n; i++)\n {\n reserved_a[i] = a[i];\n }\n\n delete[] a;\n a = reserved_a;\n capacity = reserved_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void resize(int resized_size) // ใชใตใคใบ้ขๆฐ\n {\n int *resized_a = new int[resized_size]; // aใฎใตใคใบใๅคๆด\n\n int copysize = min(resized_size, n);\n\n for (int i = 0; i < copysize; i++)\n {\n resized_a[i] = a[i];\n }\n\n delete[] a;\n a = resized_a;\n n = resized_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void push_back(int newvalue) // push_back้ขๆฐ\n {\n if (n == capacity) // ๅฎน้ไธๆฏ\n {\n resize(n + 1);\n }\n a[n] = newvalue;\n n++;\n }\n\n int size() const // ใตใคใบๅๅพ\n {\n return n;\n }\n\n int &operator[](int soeji)//\n {\n return a[soeji];\n }\n};\n\nint main()\n{\n int n;\n cin >> n;\n\n my_vector card;\n card.reserve(n);\n for (int i = 0; i < n; ++i)\n {\n int x;\n cin >> x;\n card.push_back(x);\n }\n\n // ใทใงใซใฝใผใ\n int cnt = 0;\n int m = 1 + log2(n);\n cout << m << \"\\n\";\n\n for (int g = n; g > 0; g /= 2) // ๆฟๅ
ฅใฝใผใใใใใใณgใฎๅคใๅๅใซใใ\n {\n for (int i = g; i < n; i++) // card[g]ใใฝใผใ\n {\n int v = card[i]; // ใฝใผใใใใซใผใ\n int j = i - g; // ๆฏ่ผใใใซใผใ\n while (j >= 0 && card[j] > v) // ๆฏ่ผใใใซใผใ๏ผใฝใผใใใใซใผใ\n {\n card[j + g] = card[j]; // ใซใผใใๅ
ฅใๆฟใใ\n j = j - g;\n cnt++;\n }\n card[j + g] = v;\n }\n cout << g << \" \";\n }\n cout << \"\\n\";\n\n cout << cnt << \"\\n\";\n\n for (int i = 0; i < n; i++)\n {\n cout << card[i] << \"\\n\"; // ใซใผใ่กจ็คบ\n }\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 7564,
"score_of_the_acc": -0.3401,
"final_rank": 4
},
{
"submission_id": "aoj_ALDS1_2_D_10995190",
"code_snippet": "#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass my_vector\n{\nprivate: // ้ ใใใฎใๅคใใ่ฆใใชใ\n int *a; // ๅฏๅค้ท้
ๅ\n int n; // ่ฆ็ด ๆฐ\n int capacity; // ็ขบไฟใใๅฎน้\n\npublic: // ๅ
ฌ้ใใใใฎ\n my_vector() // vectorๅฎ็พฉใๅผๆฐ็กใใๅๆๅ\n {\n a = new int[0];\n n = 0;\n capacity = 0;\n } // vector<int> a;\n\n my_vector(int size) // vectorๅฎ็พฉใ่ฆ็ด ใใ\n {\n a = new int[size];\n n = size;\n capacity = size;\n } // vector<int> a(n);\n\n void reserve(int reserved_size) // reserve ใกใขใชใฎไบๅ็ขบไฟ\n {\n int *reserved_a = new int[reserved_size];\n for (int i = 0; i < n; i++)\n {\n reserved_a[i] = a[i];\n }\n\n delete[] a;\n a = reserved_a;\n capacity = reserved_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void resize(int resized_size) // ใชใตใคใบ้ขๆฐ\n {\n int *resized_a = new int[resized_size]; // aใฎใตใคใบใๅคๆด\n\n int copysize = min(resized_size, n);\n\n for (int i = 0; i < copysize; i++)\n {\n resized_a[i] = a[i];\n }\n\n delete[] a;\n a = resized_a;\n n = resized_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void push_back(int newvalue) // push_back้ขๆฐ\n {\n if (n == capacity) // ๅฎน้ๆบใฟใณ\n {\n resize(n + 1);\n }\n a[n] = newvalue;\n n++;\n }\n\n int size() const // ใตใคใบๅๅพ\n {\n return n;\n }\n\n int &operator[](int soeji)\n {\n return a[soeji];\n }\n};\n\nint main()\n{\n int n;\n cin >> n;\n\n my_vector card;\n card.reserve(n);\n for (int i = 0; i < n; ++i)\n {\n int x;\n cin >> x;\n card.push_back(x);\n }\n\n // ใทใงใซใฝใผใ\n int cnt = 0;\n int m = 1 + log2(n);\n cout << m << \"\\n\";\n\n for (int g = n; g > 0; g /= 2) // ๆฟๅ
ฅใฝใผใใใใใใณgใฎๅคใๅๅใซใใ\n {\n for (int i = g; i < n; i++) // card[g]ใใฝใผใ\n {\n int v = card[i]; // ใฝใผใใใใซใผใ\n int j = i - g; // ๆฏ่ผใใใซใผใ\n while (j >= 0 && card[j] > v) // ๆฏ่ผใใใซใผใ๏ผใฝใผใใใใซใผใ\n {\n card[j + g] = card[j]; // ใซใผใใๅ
ฅใๆฟใใ\n j = j - g;\n cnt++;\n }\n card[j + g] = v;\n }\n cout << g << \" \";\n }\n cout << \"\\n\";\n\n cout << cnt << \"\\n\";\n\n for (int i = 0; i < n; i++)\n {\n cout << card[i] << \"\\n\"; // ใซใผใ่กจ็คบ\n }\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 7568,
"score_of_the_acc": -0.3411,
"final_rank": 5
},
{
"submission_id": "aoj_ALDS1_2_D_10995157",
"code_snippet": "#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass my_vector\n{\nprivate: // ้ ใใใฎใๅคใใ่ฆใใชใ\n int *a; // ๅฏๅค้ท้
ๅ\n int n; // ่ฆ็ด ๆฐ\n int capacity; // ็ขบไฟใใๅฎน้\n\npublic: // ๅ
ฌ้ใใใใฎ\n my_vector() // vectorๅฎ็พฉใๅผๆฐ็กใใๅๆๅ\n {\n a = new int[0];\n n = 0;\n capacity = 0;\n } // vector<int> a;\n\n my_vector(int size) // vectorๅฎ็พฉใ่ฆ็ด ใใ\n {\n a = new int[size];\n n = size;\n capacity = size;\n } // vector<int> a(n);\n\n void reserve(int reserved_size) // reserve ใกใขใชใฎไบๅ็ขบไฟ\n {\n int *reserved_a = new int[reserved_size];\n for (int i = 0; i < n; i++)\n {\n reserved_a[i] = a[i];\n }\n\n delete[] a;\n a = reserved_a;\n capacity = reserved_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void resize(int resized_size) // ใชใตใคใบ้ขๆฐ\n {\n int *resized_a = new int[resized_size]; // aใฎใตใคใบใๅคๆด\n\n int copysize = min(resized_size, n);\n\n for (int i = 0; i < copysize; i++)\n {\n resized_a[i] = a[i];\n }\n\n delete[] a;\n a = resized_a;\n n = resized_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void push_back(int newvalue)\n {\n if (n == capacity)\n {\n resize(newvalue);\n }\n a[n] = newvalue;\n n++;\n }\n\n int size() const // ใตใคใบๅๅพ\n {\n return n;\n }\n\n int &operator[](int soeji)\n {\n return a[soeji];\n }\n};\n\nint main()\n{\n int n;\n cin >> n;\n\n my_vector card;\n card.reserve(n);\n for (int i = 0; i < n; ++i)\n {\n int x;\n cin >> x;\n card.push_back(x);\n }\n\n // ใทใงใซใฝใผใ\n int cnt = 0;\n int m = 1 + log2(n);\n cout << m << \"\\n\";\n\n for (int g = n; g > 0; g /= 2) // ๆฟๅ
ฅใฝใผใใใใใใณgใฎๅคใๅๅใซใใ\n {\n for (int i = g; i < n; i++) // card[g]ใใฝใผใ\n {\n int v = card[i]; // ใฝใผใใใใซใผใ\n int j = i - g; // ๆฏ่ผใใใซใผใ\n while (j >= 0 && card[j] > v) // ๆฏ่ผใใใซใผใ๏ผใฝใผใใใใซใผใ\n {\n card[j + g] = card[j]; // ใซใผใใๅ
ฅใๆฟใใ\n j = j - g;\n cnt++;\n }\n card[j + g] = v;\n }\n cout << g << \" \";\n }\n cout << \"\\n\";\n\n cout << cnt << \"\\n\";\n\n for (int i = 0; i < n; i++)\n {\n cout << card[i] << \"\\n\"; // ใซใผใ่กจ็คบ\n }\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 7568,
"score_of_the_acc": -0.3411,
"final_rank": 5
},
{
"submission_id": "aoj_ALDS1_2_D_10995085",
"code_snippet": "#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass my_vector\n{\nprivate: // ้ ใใใฎใๅคใใ่ฆใใชใ\n int *a; // ๅฏๅค้ท้
ๅ\n int n; // ่ฆ็ด ๆฐ\n int capacity; // ็ขบไฟใใๅฎน้\n\npublic: // ๅ
ฌ้ใใใใฎ\n my_vector() // vectorๅฎ็พฉใๅผๆฐ็กใใๅๆๅ\n {\n a = new int[0];\n n = 0;\n capacity = 0;\n } // vector<int> a;\n\n my_vector(int size) // vectorๅฎ็พฉใ่ฆ็ด ใใ\n {\n a = new int[size];\n n = size;\n capacity = size;\n } // vector<int> a(n);\n\n void reserve(int reserved_size) // reserve ใกใขใชใฎไบๅ็ขบไฟ\n {\n int *reserved_a = new int[reserved_size];\n for (int i = 0; i < n; i++)\n {\n reserved_a[i] = a[i];\n }\n\n delete[] a;\n a = reserved_a;\n capacity = reserved_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void resize(int resized_size) // ใชใตใคใบ้ขๆฐ\n {\n int *resized_a = new int[resized_size]; // aใฎใตใคใบใๅคๆด\n\n int copysize = min(resized_size, n);\n\n for (int i = 0; i < copysize; i++)\n {\n resized_a[i] = a[i];\n }\n\n delete[] a;\n a = resized_a;\n n = resized_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void push_back(int newvalue)\n {\n if (n == capacity)\n {\n int push_size = n + 1;\n\n int *resized_a = new int[push_size];\n\n for (int i = 0; i < n; i++) // pushใใๆฐๅญไปฅๅคใใณใใผ\n {\n resized_a[i] = a[i];\n }\n delete[] a;\n a = resized_a;\n n = push_size;\n }\n a[n] = newvalue;\n n++;\n }\n\n int size() const // ใตใคใบๅๅพ\n {\n return n;\n }\n\n int &operator[](int soeji)\n {\n return a[soeji];\n }\n};\n\nint main()\n{\n int n;\n cin >> n;\n\n my_vector card;\n card.reserve(n);\n for (int i = 0; i < n; ++i)\n {\n int x;\n cin >> x;\n card.push_back(x);\n }\n\n // ใทใงใซใฝใผใ\n int cnt = 0;\n int m = 1 + log2(n);\n cout << m << \"\\n\";\n\n for (int g = n; g > 0; g /= 2) // ๆฟๅ
ฅใฝใผใใใใใใณgใฎๅคใๅๅใซใใ\n {\n for (int i = g; i < n; i++) // card[g]ใใฝใผใ\n {\n int v = card[i]; // ใฝใผใใใใซใผใ\n int j = i - g; // ๆฏ่ผใใใซใผใ\n while (j >= 0 && card[j] > v) // ๆฏ่ผใใใซใผใ๏ผใฝใผใใใใซใผใ\n {\n card[j + g] = card[j]; // ใซใผใใๅ
ฅใๆฟใใ\n j = j - g;\n cnt++;\n }\n card[j + g] = v;\n }\n cout << g << \" \";\n }\n cout << \"\\n\";\n\n cout << cnt << \"\\n\";\n\n for (int i = 0; i < n; i++)\n {\n cout << card[i] << \"\\n\"; // ใซใผใ่กจ็คบ\n }\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 7568,
"score_of_the_acc": -0.3411,
"final_rank": 5
},
{
"submission_id": "aoj_ALDS1_2_D_10975752",
"code_snippet": "#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass my_vector\n{\nprivate: // ้ ใใใฎใๅคใใ่ฆใใชใ\n int *a; // ๅฏๅค้ท้
ๅ\n int n; // ่ฆ็ด ๆฐ\n int capacity; // ็ขบไฟใใๅฎน้\n\npublic: // ๅ
ฌ้ใใใใฎ\n my_vector() // vectorๅฎ็พฉใๅผๆฐ็กใใๅๆๅ\n {\n a = new int[0];\n n = 0;\n capacity = 0;\n } // vector<int> a;\n\n my_vector(int size) // vectorๅฎ็พฉใ่ฆ็ด ใใ\n {\n a = new int[size];\n n = size;\n capacity = size;\n } // vector<int> a(n);\n\n void reserve(int reserved_size) // reserve ใกใขใชใฎไบๅ็ขบไฟ\n {\n int *reserved_a = new int[reserved_size];\n for (int i = 0; i < n; i++)\n {\n reserved_a[i] = a[i];\n }\n\n delete[] a;\n a = reserved_a;\n capacity = reserved_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void resize(int resized_size) // ใชใตใคใบ้ขๆฐ\n {\n int *resized_a = new int[resized_size]; // aใฎใตใคใบใๅคๆด\n\n int copysize = min(resized_size, n);\n\n for (int i = 0; i < copysize; i++)\n {\n resized_a[i] = a[i];\n }\n\n delete[] a;\n a = resized_a;\n n = resized_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void push_back(int pushback)\n {\n if (n >= capacity)\n {\n int push_size = n + 1;\n\n int *resized_a = new int[push_size];\n\n for (int i = 0; i < n; i++) // pushใใๆฐๅญไปฅๅคใใณใใผ\n {\n resized_a[i] = a[i];\n }\n delete[] a;\n a = resized_a;\n n = push_size;\n }\n a[n] = pushback;\n n++;\n }\n\n int size() const // ใตใคใบๅๅพ\n {\n return n;\n }\n\n int &operator[](int soeji)\n {\n return a[soeji];\n }\n};\n\nint main()\n{\n int n;\n cin >> n;\n\n my_vector card;\n card.reserve(n);\n for (int i = 0; i < n; ++i)\n {\n int x;\n cin >> x;\n card.push_back(x);\n }\n\n // ใทใงใซใฝใผใ\n int cnt = 0;\n int m = 1 + log2(n);\n cout << m << \"\\n\";\n\n for (int g = n; g > 0; g /= 2) // ๆฟๅ
ฅใฝใผใใใใใใณgใฎๅคใๅๅใซใใ\n {\n for (int i = g; i < n; i++) // card[g]ใใฝใผใ\n {\n int v = card[i]; // ใฝใผใใใใซใผใ\n int j = i - g; // ๆฏ่ผใใใซใผใ\n while (j >= 0 && card[j] > v) // ๆฏ่ผใใใซใผใ๏ผใฝใผใใใใซใผใ\n {\n card[j + g] = card[j]; // ใซใผใใๅ
ฅใๆฟใใ\n j = j - g;\n cnt++;\n }\n card[j + g] = v;\n }\n cout << g << \" \";\n }\n cout << \"\\n\";\n\n cout << cnt << \"\\n\";\n\n for (int i = 0; i < n; i++)\n {\n cout << card[i] << \"\\n\"; // ใซใผใ่กจ็คบ\n }\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 7568,
"score_of_the_acc": -0.3411,
"final_rank": 5
},
{
"submission_id": "aoj_ALDS1_2_D_10962540",
"code_snippet": "#include <iostream>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nclass my_vector\n{\nprivate: // ้ ใใใฎใๅคใใ่ฆใใชใ\n int *a; // ๅฏๅค้ท้
ๅ\n int n; // ่ฆ็ด ๆฐ\n int capacity; // ็ขบไฟใใๅฎน้\n\npublic: // ๅ
ฌ้ใใใใฎ\n my_vector() // vectorๅฎ็พฉใๅผๆฐ็กใใๅๆๅ\n {\n a = new int[0];\n n = 0;\n capacity = 0;\n } // vector<int> a;\n\n my_vector(int size) // vectorๅฎ็พฉใ่ฆ็ด ใใ\n {\n a = new int[size];\n n = size;\n capacity = size;\n } // vector<int> a(n);\n\n void reserve(int reserved_size) // reserve ใกใขใชใฎไบๅ็ขบไฟ\n {\n int *reserved_a = new int[reserved_size];\n for (int i = 0; i < n; i++)\n {\n reserved_a[i] = a[i];\n }\n\n delete[] a;\n a = reserved_a;\n capacity = reserved_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void resize(int resized_size) // ใชใตใคใบ้ขๆฐ\n {\n int *resized_a = new int[resized_size]; // aใฎใตใคใบใๅคๆด\n\n int copysize = min(resized_size, n);\n\n for (int i = 0; i < copysize; i++)\n {\n resized_a[i] = a[i];\n }\n\n delete[] a;\n a = resized_a;\n n = resized_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n }\n\n void push_back(int pushback)\n {\n /* int push_size = n + 1;\n\n int *resized_a = new int[push_size];\n\n for (int i = 0; i < n; i++) // pushใใๆฐๅญไปฅๅคใใณใใผ\n {\n resized_a[i] = a[i];\n }\n resized_a[n] = pushback;\n\n delete[] a;\n a = resized_a;\n n = push_size; // ใตใคใบใๅคๆดใใใๅพใฎใตใคใบใๅๅพ\n */\n // ๅฎน้ใ่ถณใใชใๅ ดๅใฏใๅใซใใฆๅ็ขบไฟ\n if (n >= capacity)\n {\n int new_capacity = (capacity == 0) ? 1 : capacity * 2;\n reserve(new_capacity);\n }\n\n a[n] = pushback;\n n++;\n }\n\n int size() const // ใตใคใบๅๅพ\n {\n return n;\n }\n\n int &operator[](int soeji)\n {\n return a[soeji];\n }\n};\n\nint main()\n{\n int n;\n cin >> n;\n\n my_vector card;\n card.reserve(n);\n for (int i = 0; i < n; ++i)\n {\n int x;\n cin >> x;\n card.push_back(x);\n }\n\n // ใทใงใซใฝใผใ\n int cnt = 0;\n int m = 1 + log2(n);\n cout << m << \"\\n\";\n\n for (int g = n; g > 0; g /= 2) // ๆฟๅ
ฅใฝใผใใใใใใณgใฎๅคใๅๅใซใใ\n {\n for (int i = g; i < n; i++) // card[g]ใใฝใผใ\n {\n int v = card[i]; // ใฝใผใใใใซใผใ\n int j = i - g; // ๆฏ่ผใใใซใผใ\n while (j >= 0 && card[j] > v) // ๆฏ่ผใใใซใผใ๏ผใฝใผใใใใซใผใ\n {\n card[j + g] = card[j]; // ใซใผใใๅ
ฅใๆฟใใ\n j = j - g;\n cnt++;\n }\n card[j + g] = v;\n }\n cout << g << \" \";\n }\n cout << \"\\n\";\n\n cout << cnt << \"\\n\";\n\n for (int i = 0; i < n; i++)\n {\n cout << card[i] << \"\\n\"; // ใซใผใ่กจ็คบ\n }\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 7568,
"score_of_the_acc": -0.3411,
"final_rank": 5
},
{
"submission_id": "aoj_ALDS1_2_D_10960391",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint cnt;\nvector<int> g;\nvoid insertionSort(vector<int> &a, int g){\n int n = (int)a.size();\n for (int i = g; i < n; i++){\n int v = a[i];\n int j = i - g;\n while(j >= 0 && a[j] > v){\n a[j+g] = a[j];\n j -= g;\n cnt++;\n }\n a[j+g] = v;\n }\n}\n\nvoid shellSort(vector<int> &a, vector<int> &g){\n cnt = 0;\n for (int h = 1; h <= (int)a.size(); h = 3*h+1) g.push_back(h);\n reverse(g.begin(), g.end());\n for (int i = 0; i < (int)g.size(); i++){\n insertionSort(a, g[i]);\n }\n}\n\nint main(){\n int n; cin >> n;\n vector<int>a(n);\n for (int i = 0; i < n; i++) cin >> a[i];\n shellSort(a,g);\n\n cout << g.size() << '\\n';\n for (int i = 0; i < (int)g.size(); i++){\n if (i>0) cout << ' ';\n cout << g[i];\n }\n cout << '\\n';\n cout << cnt << '\\n';\n for (int i = 0; i < n; i++){\n cout << a[i] << '\\n';\n }\n\n\n}",
"accuracy": 1,
"time_ms": 380,
"memory_kb": 6768,
"score_of_the_acc": -0.2222,
"final_rank": 1
},
{
"submission_id": "aoj_ALDS1_2_D_10955592",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstatic long long cnt = 0;\n\n// gap g ใฎๆฟๅ
ฅใฝใผใ๏ผ็ไผผใณใผใใฎ insertionSort(A, n, g)๏ผ\nvoid insertionSort(vector<long long> &A, int n, int g) {\n for (int i = g; i < n; i++) {\n long long v = A[i];\n int j = i - g;\n while (j >= 0 && A[j] > v) {\n A[j + g] = A[j];\n j -= g;\n cnt++; // ็ไผผใณใผใ 8่ก็ฎ๏ผใทใใๅๆฐใใซใฆใณใ\n }\n A[j + g] = v;\n }\n}\n\n// shellSort ๆฌไฝ๏ผ็ไผผใณใผใใฎ shellSort(A, n)๏ผ\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int n;\n if (!(cin >> n)) return 0;\n vector<long long> A(n);\n for (int i = 0; i < n; i++) cin >> A[i];\n\n // 1) G๏ผKnuthใฎๆฐๅ๏ผไฝๆ๏ผ1, 4, 13, ... ใง n ไปฅไธใพใง\n vector<int> G;\n for (long long h = 1; h <= n; h = 3 * h + 1) G.push_back((int)h);\n reverse(G.begin(), G.end()); // ๅคงใใใใฎใใไฝฟใ๏ผ็ไผผใณใผใ 15-16่ก็ฎใฎๆๅณ๏ผ\n\n // 2) ๅบๅ็จ m\n int m = (int)G.size();\n cout << m << \"\\n\";\n for (int i = 0; i < m; i++) {\n if (i) cout << \" \";\n cout << G[i];\n }\n cout << \"\\n\";\n\n // 3) ใทใงใซใฝใผใๅฎ่ก\n cnt = 0;\n for (int g : G) insertionSort(A, n, g);\n\n // 4) cnt ใจใๆดๅๅพใฎ้
ๅใๅบๅ\n cout << cnt << \"\\n\";\n for (int i = 0; i < n; i++) cout << A[i] << \"\\n\";\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 200,
"memory_kb": 10664,
"score_of_the_acc": -1,
"final_rank": 19
},
{
"submission_id": "aoj_ALDS1_2_D_10946264",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <math.h>\n\nusing namespace std;\n\nint main()\n{\n int n;\n cin >> n;\n\n vector<int> card;\n //card.reserve(n);\n for (int i = 0; i < n; ++i)\n {\n int x;\n cin >> x;\n card.push_back(x);\n }\n\n // ใทใงใซใฝใผใ\n int cnt = 0;\n int m = 1 + log2(n);\n cout << m << \"\\n\";\n\n for (int g = n; g > 0; g /= 2) // ๆฟๅ
ฅใฝใผใใใใใใณgใฎๅคใๅๅใซใใ\n {\n for (int i = g; i < n; i++) // card[g]ใใฝใผใ\n {\n int v = card[i]; // ใฝใผใใใใซใผใ\n int j = i - g; // ๆฏ่ผใใใซใผใ\n while (j >= 0 && card[j] > v) // ๆฏ่ผใใใซใผใ๏ผใฝใผใใใใซใผใ\n {\n card[j + g] = card[j]; // ใซใผใใๅ
ฅใๆฟใใ\n j = j - g;\n cnt++;\n }\n card[j + g] = v;\n }\n cout << g << \" \";\n }\n cout << \"\\n\";\n\n cout << cnt << \"\\n\";\n\n for (int i = 0; i < n; i++)\n {\n cout << card[i] << \"\\n\"; // ใซใผใ่กจ็คบ\n }\n}",
"accuracy": 1,
"time_ms": 320,
"memory_kb": 7636,
"score_of_the_acc": -0.3709,
"final_rank": 14
},
{
"submission_id": "aoj_ALDS1_2_D_10946262",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <math.h>\n\nusing namespace std;\n\nint main()\n{\n int n;\n cin >> n;\n\n vector<int> card;\n card.reserve(n);\n for (int i = 0; i < n; ++i)\n {\n int x;\n cin >> x;\n card.push_back(x);\n }\n\n // ใทใงใซใฝใผใ\n int cnt = 0;\n int m = 1 + log2(n);\n cout << m << \"\\n\";\n\n for (int g = n; g > 0; g /= 2) // ๆฟๅ
ฅใฝใผใใใใใใณgใฎๅคใๅๅใซใใ\n {\n for (int i = g; i < n; i++) // card[g]ใใฝใผใ\n {\n int v = card[i]; // ใฝใผใใใใซใผใ\n int j = i - g; // ๆฏ่ผใใใซใผใ\n while (j >= 0 && card[j] > v) // ๆฏ่ผใใใซใผใ๏ผใฝใผใใใใซใผใ\n {\n card[j + g] = card[j]; // ใซใผใใๅ
ฅใๆฟใใ\n j = j - g;\n cnt++;\n }\n card[j + g] = v;\n }\n cout << g << \" \";\n }\n cout << \"\\n\";\n\n cout << cnt << \"\\n\";\n\n for (int i = 0; i < n; i++)\n {\n cout << card[i] << \"\\n\"; // ใซใผใ่กจ็คบ\n }\n}",
"accuracy": 1,
"time_ms": 320,
"memory_kb": 7436,
"score_of_the_acc": -0.3196,
"final_rank": 3
},
{
"submission_id": "aoj_ALDS1_2_D_10946257",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <math.h>\n\nusing namespace std;\n\nint main()\n{\n int n;\n cin >> n;\n\n vector<int> card;\n for (int i = 0; i < n; ++i)\n {\n int x;\n cin >> x;\n card.push_back(x);\n }\n\n // ใทใงใซใฝใผใ\n int cnt = 0;\n int m = 1 + log2(n);\n cout << m << \"\\n\";\n\n for (int g = n; g > 0; g /= 2) // ๆฟๅ
ฅใฝใผใใใใใใณgใฎๅคใๅๅใซใใ\n {\n for (int i = g; i < n; i++) // card[g]ใใฝใผใ\n {\n int v = card[i]; // ใฝใผใใใใซใผใ\n int j = i - g; // ๆฏ่ผใใใซใผใ\n while (j >= 0 && card[j] > v) // ๆฏ่ผใใใซใผใ๏ผใฝใผใใใใซใผใ\n {\n card[j + g] = card[j]; // ใซใผใใๅ
ฅใๆฟใใ\n j = j - g;\n cnt++;\n }\n card[j + g] = v;\n }\n cout << g << \" \";\n }\n cout << \"\\n\";\n\n cout << cnt << \"\\n\";\n\n for (int i = 0; i < n; i++)\n {\n cout << card[i] << \"\\n\"; // ใซใผใ่กจ็คบ\n }\n}",
"accuracy": 1,
"time_ms": 310,
"memory_kb": 8656,
"score_of_the_acc": -0.6204,
"final_rank": 15
},
{
"submission_id": "aoj_ALDS1_2_D_10938908",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cmath> \nusing namespace std;\n\nint cnt = 0;\n\nvoid insertionSort(vector<int>& A, int n, int g) {\n for (int i = g; i < n; ++i) {\n int v = A[i];\n int j = i - g;\n while (j >= 0 && A[j] > v) {\n A[j + g] = A[j];\n j -= g;\n cnt++;\n }\n A[j + g] = v;\n }\n}\n\nint main() {\n int n;\n cin >> n;\n vector<int> A(n);\n for (int i = 0; i < n; ++i) {\n cin >> A[i];\n }\n\n int m = 1;\n while ((pow(3, m + 1) + 1) / 2 <= n) {\n ++m;\n }\n\n vector<int> G(m);\n for (int i = 0; i < m; ++i) {\n G[i] = (static_cast<int>(pow(3, i)) + 1) / 2;\n }\n\n for (int i = m - 1; i >= 0; --i) {\n insertionSort(A, n, G[i]);\n }\n \n cout << m << \"\\n\";\n for (int i = m - 1; i >= 0; --i) {\n cout << G[i];\n if (i != 0) cout << \" \";\n }\n cout << \"\\n\";\n cout << cnt << \"\\n\";\n for (int i = 0; i < n; ++i) {\n cout << A[i] << \"\\n\";\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 370,
"memory_kb": 6820,
"score_of_the_acc": -0.2232,
"final_rank": 2
},
{
"submission_id": "aoj_ALDS1_2_D_10938832",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\nint insertionsort(vector<int> &A, int g)\n{\n int cnt = 0;\n int n = A.size();\n for (int i = g; i <= n - 1; i++)\n {\n int v = A[i];\n int j = i - g;\n while (j >= 0 && A[j] > v)\n {\n A[j + g] = A[j];\n j = j - g;\n cnt++;\n }\n A[j + g] = v;\n }\n return cnt;\n}\n\nint shellSort(vector<int> &A, vector<int> &G)\n{\n int cnt = 0; // ไบคๆๅๆฐ\n\n for (int g : G)\n {\n cnt += insertionsort(A, g);\n }\n return cnt;\n}\n\nint main()\n{\n int n;\n cin >> n;\n\n int cnt;\n vector<int> A(n);\n for (int &a:A)\n {\n cin >> a;\n }\n vector<int> G;\n for (int i = n; i > 0; i /= 2)\n {\n G.push_back(i);\n }\n int m = G.size();\n\n cnt = shellSort(A, G);\n\n cout << m << endl;\n for (int g : G)\n {\n cout << g << \" \";\n }\n cout << endl\n << cnt << endl;\n for (int a : A)\n {\n cout << a << endl;\n }\n}",
"accuracy": 1,
"time_ms": 1010,
"memory_kb": 6880,
"score_of_the_acc": -1.0287,
"final_rank": 20
}
] |
aoj_ALDS1_1_D_cpp
|
Maximum Profit
You can obtain profits from foreign exchange margin transactions. For example, if you buy 1000 dollar at a rate of 100 yen per dollar, and sell them at a rate of 108 yen per dollar, you can obtain (108 - 100) ร 1000 = 8000 yen.
Write a program which reads values of a currency $R_t$ at a certain time $t$ ($t = 0, 1, 2, ... n-1$), and reports the maximum value of $R_j - R_i$ where $j > i$ .
Input
The first line contains an integer $n$. In the following $n$ lines, $R_t$ ($t = 0, 1, 2, ... n-1$) are given in order.
Output
Print the maximum value in a line.
Constraints
$2 \leq n \leq 200,000$
$1 \leq R_t \leq 10^9$
Sample Input 1
6
5
3
1
3
4
3
Sample Output 1
3
Sample Input 2
3
4
3
2
Sample Output 2
-1
|
[
{
"submission_id": "aoj_ALDS1_1_D_11066075",
"code_snippet": "#include<iostream>\nusing namespace std;\nint main ( ) {\n\tint n = 0, min = 0, result = -1000000000, temp = 0;\n\tcin >> n;\n\tcin >> min;\n\tfor (int i = 0; i < n-1; i++) {\n\t\tcin >> temp;\n\t\tif (temp - min > result) {\n\t\t\tresult = temp - min;\n\t\t}\n\t\tif (temp < min) {\n\t\t\tmin = temp;\n\t\t}\n\t\t\n\t}\n\tcout << result << endl;\n\t\n\t\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3440,
"score_of_the_acc": -1.2275,
"final_rank": 6
},
{
"submission_id": "aoj_ALDS1_1_D_11064399",
"code_snippet": "#include<bits/stdc++.h> \nusing namespace std;\nint gcd(int a, int b) {\n while (b != 0) {\n int temp = b;\n b = a % b;\n a = temp;\n }\n return a;\n}\nint lcm(int a, int b) {\n return a / gcd(a, b) * b;\n}\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n ; \n cin>>n;\n int a[n] , result = INT_MIN;\n for(int i = 0 ; i<n ; i++){\n cin>>a[i];\n }\n int b[n];\n b[0] = a[0] ;\n for(int i = 1 ; i < n ; i++){\n b[i] = min(b[i-1] , a[i]);\n }\n for(int i = 1 ; i < n ; i++){\n result = max(result , a[i] - b[i-1]);\n }\n cout<<result<<\"\\n\";\n }",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 5016,
"score_of_the_acc": -1,
"final_rank": 3
},
{
"submission_id": "aoj_ALDS1_1_D_11057125",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\nint main() {\n ll n;\n cin>>n;\n ll num;\n cin>>num;\n ll ans = -100000000000000;\n ll now = num;\n for (int i = 1; i < n; i++) {\n cin>>num;\n ans = max(ans, num-now);\n now = min(now, num);\n }\n cout<<ans<<\"\\n\";\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3584,
"score_of_the_acc": -0.9647,
"final_rank": 2
},
{
"submission_id": "aoj_ALDS1_1_D_11055774",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main(){\n int n;\n cin>>n;\n int minprice=2000000001,maxpr=-1000000001;\n for(int i=0;i<n;i++){\n int a;\n cin>>a;\n maxpr=max(maxpr,a-minprice);\n minprice=min(a,minprice);\n }\n cout<<maxpr<<endl;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3436,
"score_of_the_acc": -1.2255,
"final_rank": 4
},
{
"submission_id": "aoj_ALDS1_1_D_11027237",
"code_snippet": "#include <iostream>\n#include <cmath>\n#include <iomanip>\nusing namespace std;\n\nint main() {\n\tint n ;\n\tcin >> n;\n\tlong ans= -9999999999,min;\n\tcin>>min;\n\tfor (int i = 0; i < n-1; i++) {\n\t\t\tlong a;\n\t\t\tcin>>a;\n\t\t\tif(ans<(a-min)){ans=a-min;}\n\t\t\tif(a<=min){min=a;}\n\t\t}\n\t\tcout<<ans<<endl;\n\t\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3436,
"score_of_the_acc": -1.2255,
"final_rank": 4
},
{
"submission_id": "aoj_ALDS1_1_D_11025444",
"code_snippet": "#include <iostream>\n#include <cmath>\n#include <iomanip>\nusing namespace std;\n\nint main() {\n\tint n;\n\tcin >> n;\n\tlong t = -999999999999999, a[10000];\n\t\tfor (int i = 0; i < n; i++) {\n\t\t cin>>a[i];\n\t\t}\n\tfor (int i = 0; i < n; i++) {\n\t int j = i+1;\n\t\t while(j<=n-1)\n\t\t {\n\t\t if(a[j]- a[i]>t){t=a[j]- a[i];}\n\t\t j++;\n\t\t }\n\t\t}\n\t\tcout<<fixed<<setprecision(21);\n\t\tcout<<t<<endl;\n\t\treturn 0;\n}",
"accuracy": 0.875,
"time_ms": 20,
"memory_kb": 3440,
"score_of_the_acc": -0.5608,
"final_rank": 20
},
{
"submission_id": "aoj_ALDS1_1_D_11013992",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int n;cin >> n;\n vector<int>v(n);\n for(int i=0;i<n;i++){\n cin >> v.at(i);\n }\n int minv = v.at(0);\n int maxv = v[1]-v[0];\n for(int i=1;i<n;i++){\n maxv=max(maxv,v.at(i)-minv);\n minv=min(minv,v.at(i));\n }\n cout << maxv << endl;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3864,
"score_of_the_acc": -1.4353,
"final_rank": 9
},
{
"submission_id": "aoj_ALDS1_1_D_11009041",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint n;\nint a[200005];\nint mx=-2000005,mn=0x3f3f3f3f;\nint main(){\n\tcin>>n;\n\tfor(int i=1;i<=n;i++)cin>>a[i];\n\tmx=-2000000005;\n\tmn=a[1];\n\tfor(int i=2;i<=n;i++){\n\t\tmx=max(mx,a[i]-mn);\n\t\tmn=min(mn,a[i]);\n\t}\n\tcout<<mx<<endl;\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 4116,
"score_of_the_acc": -1.5588,
"final_rank": 12
},
{
"submission_id": "aoj_ALDS1_1_D_11003818",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main(){\n int n, R[200000];\n cin >> n >> R[0];\n\n int minv = R[0], maxv = -1e9;\n\n for(int i = 1; i < n; i++){\n cin >> R[i];\n maxv = maxv > (R[i] - minv) ? maxv : R[i] - minv;\n minv = R[i] < minv ? R[i] : minv; \n }\n cout << maxv << endl;\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 4144,
"score_of_the_acc": -1.5725,
"final_rank": 14
},
{
"submission_id": "aoj_ALDS1_1_D_11003798",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n int R[200000];\n for(int i = 0; i < n; i++)\n cin >> R[i];\n\n int minv = R[0], maxv = -1e9;\n\n for(int j = 1; j < n; j++){\n maxv = maxv > (R[j] - minv) ? maxv : R[j] - minv;\n minv = R[j] < minv ? R[j] : minv; \n }\n cout << maxv << endl;\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 4216,
"score_of_the_acc": -1.6078,
"final_rank": 17
},
{
"submission_id": "aoj_ALDS1_1_D_11003164",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n;\n cin >> n;\n vector<int> v(n);\n for (int i = 0; i < n; i++) cin >> v[i];\n\n int minv = v[0];\n int maxv = v[1] - v[0]; // ๆๅใฎ2ใคใฎๅทฎใๅๆๅคใซ\n for (int i = 1; i < n; i++) {\n maxv = max(maxv, v[i] - minv);\n minv = min(minv, v[i]);\n }\n cout << maxv << endl;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3760,
"score_of_the_acc": -1.3843,
"final_rank": 8
},
{
"submission_id": "aoj_ALDS1_1_D_10998577",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main()\n{\n int n;\n cin >> n;\n int ans = INT32_MIN, bruh;\n cin >> bruh;\n for (int i=0, tmp; i<(n-1); i++)\n {\n cin >> tmp;\n ans = max(ans, tmp-bruh);\n bruh = (bruh > tmp)? tmp : bruh;\n }\n cout << ans << \"\\n\";\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3480,
"score_of_the_acc": -1.2471,
"final_rank": 7
},
{
"submission_id": "aoj_ALDS1_1_D_10995725",
"code_snippet": "/*10.28*/\n#include <iostream>\n\nusing namespace std;\n\nint main() {\n\n int maxv, minv;\n\n int n;\n \n cin >> n;\n\n int rt[n];\n\n for (int i = 0;i < n;i++) cin >> rt[i];\n\n\n maxv = rt[1] - rt[0];\n minv = rt[0];\n for (int j = 1; j < n;j++) {\n maxv = max(maxv, rt[j] - minv);\n minv = min(minv, rt[j]);\n }\n\n cout << maxv << endl;\n\n\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 4212,
"score_of_the_acc": -1.6059,
"final_rank": 15
},
{
"submission_id": "aoj_ALDS1_1_D_10970206",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main(){\n int n, max, min, i;\n int ex[200'000];\n cin >> n;\n for(i = 0; i < n; i++) cin >> ex[i];\n\n min = ex[0];\n max = ex[1]-min;\n for(i = 1; i < n; i ++){\n if(ex[i]-min > max) max = ex[i]-min;\n if(ex[i] < min) min = ex[i];\n }\n\n cout << max << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 4216,
"score_of_the_acc": -1.6078,
"final_rank": 17
},
{
"submission_id": "aoj_ALDS1_1_D_10965557",
"code_snippet": "#include<iostream>\nusing namespace std;\nint main(void){\n int n,minnn=1000000001,maxxx=-1000000001;\n cin>>n;\n int a[200000]={0};\n for(int i=0;i<n;i++){\n cin>>a[i];\n }\n minnn=min(minnn,a[0]);\n for(int i=1;i<n;i++){\n maxxx=max(maxxx,a[i]-minnn);\n minnn=min(minnn,a[i]);\n }\n cout<<maxxx<<endl;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 4216,
"score_of_the_acc": -1.6078,
"final_rank": 17
},
{
"submission_id": "aoj_ALDS1_1_D_10955968",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\n\nint main(void){\n int n;\n cin >> n;\n\n vector<int> a;\n for(int i = 0; i < n; i++){\n int x;\n cin >> x;\n a.push_back(x);\n }\n\n int maxv = -1000000000;\n int minv = a[0];\n\n\n for (int i = 1; i < n; i++)\n {\n maxv = max(maxv , a[i] - minv);\n minv = min(minv , a[i]);\n }\n \n cout << maxv << endl;\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 4128,
"score_of_the_acc": -1.5647,
"final_rank": 13
},
{
"submission_id": "aoj_ALDS1_1_D_10951640",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n#define rep(i, N) for (int i = 0; i < N; ++i)\n\nint main() {\n int n;\n cin >> n;\n vector<int> R(n);\n rep(i, n) cin >> R[i];\n\n int currmin = R[0];\n int res = INT_MIN;\n for (int i = 1; i < n; ++i) {\n res = max(res, R[i] - currmin);\n currmin = min(currmin, R[i]);\n }\n\n cout << res << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 3872,
"score_of_the_acc": -1.4392,
"final_rank": 10
},
{
"submission_id": "aoj_ALDS1_1_D_10941339",
"code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nint main() {\n int n;\n cin >> n;\n \n int R[200000];\n for (int i = 0; i < n; i++) {\n cin >> R[i];\n }\n \n int minv = R[0];\n int maxv = R[1] - R[0];\n \n for (int j = 1; j < n; j++) {\n maxv = max(maxv, R[j] - minv);\n minv = min(minv, R[j]);\n }\n \n cout << maxv << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 4212,
"score_of_the_acc": -1.6059,
"final_rank": 15
},
{
"submission_id": "aoj_ALDS1_1_D_10941337",
"code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n \n int R[200000];\n for (int i = 0; i < n; i++) {\n cin >> R[i];\n }\n \n int minv = R[0];\n int maxv = R[1] - R[0];\n \n for (int j = 1; j < n; j++){\n maxv = max(maxv, R[j]-minv);\n minv = min(minv, R[j]);\n }\n \n cout << maxv << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 40,
"memory_kb": 4100,
"score_of_the_acc": -1.551,
"final_rank": 11
},
{
"submission_id": "aoj_ALDS1_1_D_10940926",
"code_snippet": "#include <stdio.h>\n#include <limits.h>\n\nusing namespace std;\n\nint main(){\n\tint n,tmp,min=INT_MAX,max=INT_MIN;\n\tscanf(\"%d\",&n);\n\tfor(int i = 0; i < n; i++){\n\t\tscanf(\"%d\",&tmp);\n\t\tif(max < tmp-min) max = tmp - min;\n\t\tif(min > tmp) min = tmp;\n\t}\n\tprintf(\"%d\\n\",max);\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2976,
"score_of_the_acc": 0,
"final_rank": 1
}
] |
aoj_ALDS1_1_C_cpp
|
Prime Numbers
A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.
Write a program which reads a list of
N
integers and prints the number of prime numbers in the list.
Input
The first line contains an integer
N
, the number of elements in the list.
N
numbers are given in the following lines.
Output
Print the number of prime numbers in the given list.
Constraints
1 โค
N
โค 10000
2 โค
an element of the list
โค 10
8
Sample Input 1
5
2
3
4
5
6
Sample Output 1
3
Sample Input 2
11
7
8
9
10
11
12
13
14
15
16
17
Sample Output 2
4
|
[
{
"submission_id": "aoj_ALDS1_1_C_11063301",
"code_snippet": "#include<bits/stdc++.h> \nusing namespace std;\nint gcd(int a, int b) {\n while (b != 0) {\n int temp = b;\n b = a % b;\n a = temp;\n }\n return a;\n}\nint lcm(int a, int b) {\n return a / gcd(a, b) * b;\n}\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int t ; \n cin>>t;\n int result = 0 ;\n for(int i = 0 ; i < t ; i++){\n long long n ; \n cin>>n;\n if(n==2 || n==3 || n==5 || n==7 || n==11 ){\n result++;\n continue;\n }\n else if(n<2){\n continue;\n }\n else if(n%2==0 || n%3==0 || n%5==0 || n%7==0 || n%11==0){\n continue;\n }\n else{\n for(int i = 13 ; i*i <= n ; i+=2){\n if(n%i==0){\n result--;\n break;\n }\n }\n }\n result++;\n }\n cout<<result<<\"\\n\";\n }",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3448,
"score_of_the_acc": -0.0369,
"final_rank": 16
},
{
"submission_id": "aoj_ALDS1_1_C_11057463",
"code_snippet": "#include <stdio.h>\nint main()\n{\n int n,c=0;\n scanf(\"%d\",&n);\n int a[n];\n for(int i=0; i<n;i++)\n {\n scanf(\"%d\",&a[i]);\n int p=1;\n if(a[i]<2)\n {\n p=0;\n }\n for(int j=2; j*j<=a[i]; j++)\n {\n if(a[i]%j==0)\n {\n p=0;\n break;\n }\n }\n if(p==1)\n {\n c++;\n }\n }\n printf(\"%d\\n\",c);\n\n return 0;\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 2992,
"score_of_the_acc": 0,
"final_rank": 1
},
{
"submission_id": "aoj_ALDS1_1_C_11025314",
"code_snippet": "#include <iostream>\n#include <cmath>\nusing namespace std;\n\nint main() {\n\tint n;\n\tcin >> n;\n\tint t = 0;\n\n\tfor (int i = 0; i < n; i++) {\n\t\tint a;\n\t\tint b = 1;\n\t\tbool isPrime =true;\n\t\tcin >> a;\n\t\twhile (b < sqrt(a - 1)) {\n\t\t\tb++;\n\t\t\tif (a % b == 0) {\n\t\t\t\tisPrime = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (isPrime==true) {\n\t\t\tt++;\n\t\t}\n\t}\n\tcout<<t<<endl;\n\treturn 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3436,
"score_of_the_acc": -0.0744,
"final_rank": 17
},
{
"submission_id": "aoj_ALDS1_1_C_11011921",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nbool isPrime(int x){\n if(x<=1)return false;\n if(x==2)return true;\n for(int i=2;i<=sqrt(x);i++){\n if(x%i==0)return false;\n }\n return true;\n}\nint main(){\n int count = 0;\n int n; cin >> n;\n for(int i=0;i<n;i++){\n int m;\n cin >> m;\n if(isPrime(m)){\n count+=1;\n }\n }\n cout << count << endl;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3348,
"score_of_the_acc": -0.0288,
"final_rank": 2
},
{
"submission_id": "aoj_ALDS1_1_C_10998606",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n int n;\n cin >> n;\n \n int ans = 0;\n for (int i=0; i<n; i++)\n {\n long long tmp;\n cin >> tmp;\n bool isPrime = (tmp%2 == 0 && tmp != 2)? false : true;\n if (isPrime)\n {\n long long lim = sqrt(tmp);\n for (int i=3; i<=lim; i+=2)\n {\n if (tmp%i == 0)\n {\n isPrime = false;\n break;\n }\n }\n }\n if (isPrime)\n ans++;\n }\n cout << ans << \"\\n\";\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3436,
"score_of_the_acc": -0.0359,
"final_rank": 13
},
{
"submission_id": "aoj_ALDS1_1_C_10997644",
"code_snippet": "#include <iostream>\n\nusing namespace std;\n\nint is_prime(int n) {\n \n if (n == 2) return 1;\n\n else if (!(n % 2)) return 0;\n \n // ๅๆๆฐใฎๅคๅฎ\n int i = 3;\n \n while (i * i <= n) {\n if (!(n % i)) return 0;\n i++;// 3 --> 5 --> 7 .......\n }\n return 1;\n\n}\n\nint main() {\n \n int n,p_count = 0;\n cin >> n;\n\n int no[n];\n\n for (int i = 0;i < n;i++) {\n cin >> no[i];\n p_count += is_prime(no[i]);\n }\n\n cout << p_count << endl;\n\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3372,
"score_of_the_acc": -0.0307,
"final_rank": 11
},
{
"submission_id": "aoj_ALDS1_1_C_10997396",
"code_snippet": "#include <iostream>\n#include <vector>\n\nstatic const int MAX = 1000000;\n\nstd::vector<bool> sieve(int limit) {\n std::vector<bool> is_prime(limit + 1, true);\n is_prime[0] = is_prime[1] = false;\n for (int i = 2; i * i <= limit; ++i) {\n if (is_prime[i]) {\n for (int j = i * i; j <= limit; j += i)\n is_prime[j] = false;\n }\n }\n return is_prime;\n}\n\nint main() {\n int n;\n std::cin >> n;\n std::vector<int> X(n);\n for (int i = 0; i < n; ++i) std::cin >> X[i];\n\n int max_val = 0;\n for (int x : X) if (x > max_val) max_val = x;\n auto is_prime = sieve(max_val);\n\n int count = 0;\n for (int x : X)\n if (x >= 2 && is_prime[x]) ++count;\n\n std::cout << count << \"\\n\";\n return 0;\n}",
"accuracy": 1,
"time_ms": 270,
"memory_kb": 15360,
"score_of_the_acc": -2,
"final_rank": 20
},
{
"submission_id": "aoj_ALDS1_1_C_10965549",
"code_snippet": "#include<iostream>\n#include<cmath>\nusing namespace std;\n\nint isprime(int);\n\nint main(){\n int n, total, i;\n int num[10'000];\n cin >> n;\n\n total = 0;\n for(i = 0; i < n; i++){\n cin >> num[i];\n\n total += isprime(num[i]);\n }\n cout << total << endl;\n return 0;\n}\n\nint isprime(int n){\n int i;\n\n if(n == 2) return 1;\n else if(n == 1 or n%2 == 0) return 0;\n else{\n for(i = 3; i <= sqrt(n); i++){\n if(n%i == 0) return 0;\n }\n return 1;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3444,
"score_of_the_acc": -0.0365,
"final_rank": 15
},
{
"submission_id": "aoj_ALDS1_1_C_10964994",
"code_snippet": "#include<iostream>\n#include<cmath>\nusing namespace std;\nint main(void){\n int c,cnt=0,t=0;\n while(cin>>c){\n if(c%2==0 or c==1){\n if(c!=2){\n cnt++;\n }\n }\n else{for(int i=3;i<=sqrt(c);i+=2){\n if(c%i==0){\n cnt++;\n break;\n }\n }\n }\n \n t++;\n }\n cout<<t-cnt<<endl;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3364,
"score_of_the_acc": -0.0301,
"final_rank": 7
},
{
"submission_id": "aoj_ALDS1_1_C_10937655",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nbool is_prime(int N){\n for (int i = 2; i*i <= N; i++) if (N%i == 0) return false;\n return true;\n}\n\nint main(){\n int N, A, count = 0;\n cin >> N;\n \n for (int _ = 0; _ < N; _++){\n cin >> A;\n if (is_prime(A)) count++;\n }\n \n cout << count << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3364,
"score_of_the_acc": -0.0301,
"final_rank": 7
},
{
"submission_id": "aoj_ALDS1_1_C_10933872",
"code_snippet": "using namespace std;\n#include <iostream>\n#include <vector>\n\nint main() {\n int n;\n cin >> n;\n vector<int> x(n);\n for (int i = 0; i < n; ++i) cin >> x[i];\n\n int c = 0;\n for (int i = 0; i < n; ++i) {\n if (x[i] < 2) continue; \n bool prime = true;\n for (int j = 2; j * j <= x[i]; ++j) {\n if (x[i] % j == 0) {\n prime = false;\n break;\n }\n }\n if (prime) c += 1;\n }\n\n cout << c << \"\\n\";\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3436,
"score_of_the_acc": -0.0359,
"final_rank": 13
},
{
"submission_id": "aoj_ALDS1_1_C_10923933",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nbool isPrime(int x){\n if (x < 2) return false;\n for (int i = 2; i*i <= x; i++){\n if (x % i == 0) return false;\n //else return true; ใใใใใจbreakใจๅใใซใชใฃใฆใใพใ\n }\n return true;\n}\n\nint main(){\n int N; cin >> N;\n int ans = 0;\n int V[N];\n for (int i = 0; i < N; i++) cin >> V[i];\n for (int i = 0; i < N; i++) if (isPrime(V[i])) ans++;\n cout << ans << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3360,
"score_of_the_acc": -0.0298,
"final_rank": 6
},
{
"submission_id": "aoj_ALDS1_1_C_10923918",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main(){\n int N; cin >> N;\n int V[N];\n int ans = 0;\n for (int i = 0; i < N; i++){\n cin >> V[i];\n \n for (int j = 2; j * j <= V[i]; j++){\n if (V[i] % j == 0){\n ans += 1;\n break;\n }\n } \n }\n cout << N - ans << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3352,
"score_of_the_acc": -0.0291,
"final_rank": 4
},
{
"submission_id": "aoj_ALDS1_1_C_10912290",
"code_snippet": "#include<iostream>\n#include<cmath>\nusing namespace std;\n\nint isDigit(int);\n\nint main(){\n int n, check, i;\n int num[10000];\n int count = 0;\n cin >> n;\n for(i = 0; i < n; i++) cin >> num[i];\n\n for(i = 0; i < n; i++){\n check = isDigit(num[i]);\n count += check;\n }\n\n cout << count << endl;\n return 0;\n}\n\nint isDigit(int n){\n int i;\n if(n == 2) return 1;\n else if(n == 1 or n%2 == 0) return 0;\n else{\n for(i = 3; i <= sqrt(n); i++){\n if(n%i == 0) return 0;\n }\n\n return 1;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3404,
"score_of_the_acc": -0.0333,
"final_rank": 12
},
{
"submission_id": "aoj_ALDS1_1_C_10909552",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define rep2(i, s, n) for (ll i = (ll)(s); i < (ll)(n); i++)\n\n\n// vectorใๅบๅใใ\nvoid vec1print(vector<ll> vec) {\n rep(i, vec.size()) {\n cout << vec[i] << endl;\n }\n}\nvoid vec2print(vector<ll> vec) {\n rep(i, vec.size()) {\n cout << vec[i] << \" \";\n }\n cout << endl;\n}\n\n// ๆๅคงใๆๅฐใๆฑใใ\nint minval(vector<ll> vec) {\n return *min_element(begin(vec), end(vec));\n}\nint maxval(vector<ll> vec) {\n return *max_element(begin(vec), end(vec));\n}\n\n// ใฐใชใใ็จ\nvector<ll> dx = {1, 0, -1, 0};\nvector<ll> dy = {0, 1, 0, -1};\nbool in_grid(ll x, ll y, ll limit_x, ll limit_y) {\n return 0 <= x and x < limit_x and 0 <= y and y < limit_y;\n}\n\n// main\nvoid solve() {\n ll n;\n cin >> n;\n ll ans = 0;\n rep(i,n) {\n ll x;\n cin >> x;\n bool ok = true;\n ll root_x = sqrt(x);\n for (ll i = 2; i <= root_x; ++i) {\n if (x % i == 0) {\n ok =false;\n }\n }\n if (ok) ans += 1;\n }\n cout << ans << endl;\n\n return;\n}\n\nint main() {\n solve();\n return 0;\n}",
"accuracy": 1,
"time_ms": 140,
"memory_kb": 3456,
"score_of_the_acc": -0.5375,
"final_rank": 19
},
{
"submission_id": "aoj_ALDS1_1_C_10881546",
"code_snippet": "#include<iostream>\n#include<cmath>\nusing namespace std;\n\nint isprime(int);\n\nint main(){\n int n, x, check, i, j;\n int count = 0;\n cin >> n;\n for(i = 0; i < n; i++){\n cin >> x;\n check = isprime(x);\n if(check == 1) count++;\n }\n cout << count << endl;\n return 0;\n}\n\nint isprime(int x){\n int i;\n if(x == 2) return 1;\n else if(x == 1 or x%2 == 0) return 0;\n else{\n for(i = 3; i <= sqrt(x); i++){\n if(x%i == 0) return 0;\n }\n return 1;\n }\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3352,
"score_of_the_acc": -0.0291,
"final_rank": 4
},
{
"submission_id": "aoj_ALDS1_1_C_10879683",
"code_snippet": "#include<iostream>\n#include<math.h>\nusing namespace std;\n\nint main(){\n int n, num = 0, count = 0; cin >> n;\n for(int i=0;i<n;i++){\n bool flag = true;\n cin >> num;\n int sqrt_num = sqrt(num);\n for(int j=2;j<=sqrt_num;j++){\n if(num % j == 0){\n flag = false;\n break;\n }\n }\n if(flag == true){\n count++;\n }\n }\n cout << count << endl; \n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3348,
"score_of_the_acc": -0.0288,
"final_rank": 2
},
{
"submission_id": "aoj_ALDS1_1_C_10879537",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint is_prime(int n) {\n if (n <= 1) return 0;\n for (int i = 2; i * i <= n; i++) {\n if (n % i == 0) return 0;\n }\n return 1;\n}\n\nint main() {\n int n;\n int ans = 0;\n cin >> n;\n vector<int> primes(n);\n for (int i = 0; i < n; i++) {\n cin >> primes[i];\n }\n for (int i = 0; i < n; i++) {\n if (is_prime(primes[i])) {\n ans++;\n }\n }\n cout << ans << endl;\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3368,
"score_of_the_acc": -0.0304,
"final_rank": 10
},
{
"submission_id": "aoj_ALDS1_1_C_10877020",
"code_snippet": "//\n// main.cpp\n// MyCp\n//\n// Created by ไปไบ้ๆณข on 2025/08/27.\n//\n\n// ===== begin my_bits.hpp =====\n//\n// my_bits.hpp\n// MyCp\n//\n// Created by ไปไบ้ๆณข on 2025/08/28.\n//\n\n#pragma once\n#include <bits/stdc++.h>\nusing namespace std;\n\n// ---------------- macro ----------------\n#define rep(i,x,limit) for (int i = (int)x; i < (int)limit; i++)\n#define REP(i,x,limit) for (int i = (int)x; i <= (int)limit; i++)\n#define repd(i,x,limit) for (int i = (int)x; i > (int)limit; i--)\n#define REPD(i,x,limit) for (int i = (int)x; i >= (int)limit; i--)\n#define ifRange(x,a,b) if (x>=a && x<=b)\n#define all(x) x.begin(), x.end()\n#define rall(x) x.rbegin(), x.rend()\n#define el '\\n'\n#define spa \" \"\n#define Yes cout << \"Yes\" << el\n#define No cout << \"No\" << el\n#define YES cout << \"YES\" << el\n#define NO cout << \"NO\" << el\n#define eps (1e-10)\n#define Equals(a,b) (fabs((a) - (b)) < eps )\n#ifdef DEBUG\n#define debug(x) cerr << \"----- DEBUG ----- \" << #x << \" = \" << x << el\n#else\n#define debug(x)\n#endif\n\ninline void setup_io(bool input=true) {\n // spped up cin/cout\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n // local only\n#ifdef DEBUG\n cerr << \"----- INFO ----- Hello world at Src!\" << el;\n filesystem::path currentPath = filesystem::current_path();\n cerr << \"----- INFO ----- Current directory: \" << currentPath.string() << el;\n if (input) {\n freopen(\"input.in\", \"r\", stdin);\n cerr << \"----- INFO ----- input.in read!\" << el;\n }\n#endif\n}\n\n// ---------------- type alias ----------------\nusing ll = long long;\nusing ull = unsigned long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\n\n// ---------------- numbers/ strings ----------------\nconst double pi = 3.141592653589793238;\nconst int inf = 1073741823;\nconst ll infl = 1LL << 60;\nconst string ABC = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string abc = \"abcdefghijklmnopqrstuvwxyz\";\n\n// ===== end my_bits.hpp =====\n\nint main() {\n setup_io(); // (false): not open input.txt\n \n // insert code here...\n int n,a, cnt=0;cin>>n;\n rep(i,0,n) {\n cin>>a;debug(a);\n if (a%2==0) {\n if(a==2) cnt++;\n continue;\n }\n int j=3;\n bool b=true;\n while (j<=sqrt(a)) {\n if(a%j==0) {\n b=false;\n break;\n }\n j+=2;\n }\n if(b) cnt++;\n }\n cout<<cnt<<el;\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 3364,
"score_of_the_acc": -0.0301,
"final_rank": 7
},
{
"submission_id": "aoj_ALDS1_1_C_10875930",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n ll N,n,a =0;\n cin >> N;\n bool b =1;\n for (ll i = 0; i < N; i++) {\n cin >> n;\n for (ll j = 2;j*j <= n;j++) {\n if (n%j == 0) {\n b = 0;\n break;\n }\n }\n if (b) {\n a++;\n }else {\n b = 1;\n }\n }\n cout << a << endl;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3412,
"score_of_the_acc": -0.1109,
"final_rank": 18
}
] |
aoj_ALDS1_4_C_cpp
|
Search III
Your task is to write a program of a simple
dictionary
which implements the following instructions:
insert
str
: insert a string
str
in to the dictionary
find
str
: if the distionary contains
str
, then print '
yes
', otherwise print '
no
'
Input
In the first line
n
, the number of instructions is given. In the following
n
lines,
n
instructions are given in the above mentioned format.
Output
Print
yes
or
no
for each find instruction in a line.
Constraints
A string consists of '
A
', '
C
', '
G
', or '
T
'
1 โค length of a string โค 12
n
โค 1000000
Sample Input 1
5
insert A
insert T
insert C
find G
find A
Sample Output 1
no
yes
Sample Input 2
13
insert AAA
insert AAC
insert AGA
insert AGG
insert TTT
find AAA
find CCC
find CCC
insert CCC
find CCC
insert T
find TTT
find T
Sample Output 2
yes
no
no
yes
yes
yes
Notes
Template in C
|
[
{
"submission_id": "aoj_ALDS1_4_C_11057022",
"code_snippet": "// โโโโโโโโโโโโโโโโโโโโโโโโโโโโโ โโโ โโโโโโโ โโโโโโโโโโโ โโโโโโโโโโโโโ โโโ\n// โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ โโโ โโโโโโโโโโโโโโโโโโโโ โโโโโโโโโโโโโโโ โโโ\n// โโโ โโโ โโโ โโโโโโโโโโโโโ โโโ โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ โโโ\n// โโโ โโโ โโโ โโโโโโโโโโโโโโโโโ โโโโโโโโโโโโโโโโโ โโโโโ โโโโโโโโโโโโโโโโโ\n// โโโ โโโ โโโ โโโ โโโโโ โโโโโโ โโโ โโโโโ โโโโโ โโโ โโโ โโโโโ โโโโโโ\n// โโโ โโโ โโโ โโโ โโโโโ โโโโโ โโโ โโโโโ โโโโโ โโโ โโโ โโโโโ โโโโโ\n// GitHub: https://github.com/raiyan/cp-template\n\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;typedef unsigned long long ull;typedef long double ld;typedef pair<int,int> pii;typedef pair<ll,ll> pll;typedef vector<int> vi;typedef vector<ll> vll;typedef vector<pii> vpii;typedef vector<pll> vpll;\n#define all(x) (x).begin(),(x).end()\n#define rall(x) (x).rbegin(),(x).rend()\n#define pb push_back\n#define mp make_pair\n#define fi first\n#define se second\n#define sz(x) (int)(x).size()\n\n#ifndef NDEBUG\nnamespace dbg{string s(int x){return to_string(x);}string s(long long x){return to_string(x);}string s(unsigned long long x){return to_string(x);}string s(double x){return to_string(x);}string s(long double x){return to_string(x);}string s(char x){return \"'\"+string(1,x)+\"'\";}string s(string x){return '\"'+x+'\"';}string s(bool x){return x?\"true\":\"false\";}string s(const char*x){return'\"'+string(x)+'\"';}template<class A,class B>string s(pair<A,B>p){return\"(\"+s(p.first)+\",\"+s(p.second)+\")\";}template<class T>string s(T v){string r=\"{\";for(auto x:v)r+=(r==\"{\"?\"\":\",\"),r+=s(x);return r+\"}\";}template<class T>string s(stack<T>st){string r=\"{\";while(!st.empty())r+=(r==\"{\"?\"\":\",\"),r+=s(st.top()),st.pop();return r+\"}\";}template<class T>string s(queue<T>q){string r=\"{\";while(!q.empty())r+=(r==\"{\"?\"\":\",\"),r+=s(q.front()),q.pop();return r+\"}\";}template<class T>string s(priority_queue<T>pq){string r=\"{\";while(!pq.empty())r+=(r==\"{\"?\"\":\",\"),r+=s(pq.top()),pq.pop();return r+\"}\";}void p(const char*n){cerr<<\"\\n\";}template<class T>void p(const char*n,T v){cerr<<n<<\"=\"<<s(v)<<\"\\n\";}template<class T,class...A>void p(const char*n,T v,A...a){for(;*n!=',';n++)cerr<<*n;cerr<<\"=\"<<s(v)<<\", \";p(n+1,a...);}}\n#define debug(...) cerr<<\"[L\"<<__LINE__<<\"]: \",dbg::p(#__VA_ARGS__,__VA_ARGS__)\n#else\n#define debug(...)\n#endif\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n int n; cin >> n;\n\n set<string> a;\n\n while (n--) {\n string s; string c;\n\n cin >> s >> c;\n\n if (s == \"insert\") {\n a.insert(c);\n } else {\n auto it = a.find(c);\n if (it != a.end()) {\n cout << \"yes\\n\";\n } else {\n cout << \"no\\n\";\n }\n }\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 410,
"memory_kb": 24900,
"score_of_the_acc": -0.4506,
"final_rank": 2
},
{
"submission_id": "aoj_ALDS1_4_C_11046388",
"code_snippet": "#include <iostream>\n#include <unordered_set>\n\nint main() {\n int n;\n std::cin >> n;\n\n std::unordered_set<std::string> dictionary;\n std::string command, word;\n\n for (int i = 0; i < n; ++i) {\n std::cin >> command >> word;\n if (command == \"insert\") {\n dictionary.insert(word);\n } else if (command == \"find\") {\n if (dictionary.count(word)) {\n std::cout << \"yes\\n\";\n } else {\n std::cout << \"no\\n\";\n }\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 680,
"memory_kb": 23664,
"score_of_the_acc": -0.6117,
"final_rank": 3
},
{
"submission_id": "aoj_ALDS1_4_C_11046375",
"code_snippet": "#include <iostream>\n#include <unordered_set>\n\n\nint main() {\n int n;\n std::cin >> n;\n\n std::unordered_set<std::string> dictionary;\n std::string command, word;\n\n for (int i = 0; i < n; ++i) {\n std::cin >> command >> word;\n if (command == \"insert\") {\n dictionary.insert(word);\n } else if (command == \"find\") {\n if (dictionary.count(word)) {\n std::cout << \"yes\\n\";\n } else {\n std::cout << \"no\\n\";\n }\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 690,
"memory_kb": 23844,
"score_of_the_acc": -0.6204,
"final_rank": 4
},
{
"submission_id": "aoj_ALDS1_4_C_11046370",
"code_snippet": "#include <iostream>\n#include <unordered_set>\n#include <string>\n\nint main() {\n int n;\n std::cin >> n;\n\n std::unordered_set<std::string> dictionary;\n std::string command, word;\n\n for (int i = 0; i < n; ++i) {\n std::cin >> command >> word;\n if (command == \"insert\") {\n dictionary.insert(word);\n } else if (command == \"find\") {\n if (dictionary.count(word)) {\n std::cout << \"yes\\n\";\n } else {\n std::cout << \"no\\n\";\n }\n }\n }\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 700,
"memory_kb": 23736,
"score_of_the_acc": -0.6256,
"final_rank": 5
},
{
"submission_id": "aoj_ALDS1_4_C_11017719",
"code_snippet": "#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#define TABLE_SIZE 16777216\n#define ORDER_LENGTH 7\n#define STR_LENGTH 13\n\nusing namespace std;\n\nint array[128];\n\nint translateStr(char buf[]){\n int sum = -1,mult = 1;\n for(int i = 0; buf[i] != '\\0'; i++){\n sum += array[buf[i]]*mult;\n mult *= 4;\n }\n return sum;\n}\n\nint main(){\n\n array['A']=1,array['C']=2,array['G']=3,array['T']=4;\n\n int n;\n scanf(\"%d\",&n);\n char order[ORDER_LENGTH],str[STR_LENGTH];\n\n char* check_table = new char[TABLE_SIZE];\n\n for(int i = 0; i < n; i++){\n scanf(\"%s %s\",order,str);\n if(order[0] == 'i'){\n check_table[translateStr(str)] = 'Y';\n }else{\n if(check_table[translateStr(str)] == 'Y'){\n printf(\"yes\\n\");\n }else{\n printf(\"no\\n\");\n }\n }\n }\n}",
"accuracy": 1,
"time_ms": 80,
"memory_kb": 6680,
"score_of_the_acc": -0.0077,
"final_rank": 1
},
{
"submission_id": "aoj_ALDS1_4_C_11017616",
"code_snippet": "#include <iostream>\n#include <string>\n#include <cstring>\n#include <vector>\n#include <set>\n#define M 1000003\n#define L 14\nusing namespace std;\n\nchar H[M][L];\n\nint getChar(char ch){\n if (ch == 'A'){\n return 1;\n }else if(ch == 'C'){\n return 2;\n }else if(ch == 'G'){\n return 3;\n }else if(ch == 'T'){\n return 4;\n }\n return 0;\n}\n\nlong long getKey(char str[]){\n long long sum,p;\n sum = 0;\n p = 1;\n for(int i = 0; i < strlen(str); i++){\n sum += p*(getChar(str[i]));\n p *= 5;\n }\n return sum;\n}\n\nint h1(int key){\n int x;\n x = key % M;\n return x;\n}\n \nint h2(int key){\n int y;\n y = 1 + (key % (M-1));\n return y;\n}\n\nint find(char str[]){\n int hash,h_1,h_2,key;\n key = getKey(str);\n h_1 = h1(key);\n h_2 = h2(key);\n for(int i = 0 ;i < M; ++i){\n hash = (h_1 + i*h_2) % M;\n if(strcmp(H[hash],str) == 0){\n return 1;\n }\n }\n return 0;\n}\n\nint insert(char str[]){\n int hash,h_1,h_2,key;\n key = getKey(str);\n h_1 = h1(key);\n h_2 = h2(key);\n for(int i = 0;i < M; ++i){\n hash = (h_1 + i*h_2) % M;\n if(H[hash][0] == '\\0'){\n strcpy(H[hash],str);\n return 1;\n }\n }\n return 0;\n}\n\n\nint main(){\n int n,h;\n vector<int> result;\n char str[L], com[9];\n for(int i = 0; i < M; ++i){\n H[i][0] = '\\0';\n }\n\n cin >> n;\n\n for(int i = 0; i < n; ++i){\n cin >> com >> str;\n if(com[0] == 'i'){ \n if (!find(str)){\n insert(str);\n }\n }else{\n if (find(str) == 1){\n result.push_back(1);\n }else{\n result.push_back(0);\n }\n }\n }\n for(int j = 0; j < result.size(); ++j){\n if (result[j] == 1){\n cout << \"yes\" << endl;\n }else{\n cout << \"no\" << endl;\n }\n }\n return 0;\n}",
"accuracy": 0.2,
"time_ms": 490,
"memory_kb": 17024,
"score_of_the_acc": -0.4047,
"final_rank": 18
},
{
"submission_id": "aoj_ALDS1_4_C_11017603",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nlong long change_acgt_string(string s);\nlong long change_acgt(char c);\n\nvoid insert(string s, bool S[]);\nbool find(string s, bool S[]);\n\nint main(){\n bool S[1 << 25] = {};\n long long n;\n cin >> n;\n for(long long i=0; i<n; ++i){\n string ask, str;\n cin >> ask >> str;\n if(ask == \"insert\"){\n insert(str, S);\n }\n if(ask == \"find\"){\n if(find(str, S)){\n cout << \"yes\";\n }\n else{\n cout << \"no\";\n }\n cout << \"\\n\";\n }\n }\n\n return 0;\n}\n\nlong long change_acgt_string(string s){\n long long a = 0;\n int i;\n for(i=0; i<s.size(); ++i){\n a |= (long long)change_acgt(s[i]) << i*2;\n }\n a |= 1 << i*2;\n return a;\n}\n\nlong long change_acgt(char c){\n if(c == 'A') return 0b00;\n else if(c == 'C') return 0b01;\n else if(c == 'G') return 0b10;\n else return 0b11;\n}\n\nvoid insert(string s, bool S[]){\n S[change_acgt_string(s)] = true;\n}\n\nbool find(string s, bool S[]){\n return S[change_acgt_string(s)];\n}",
"accuracy": 1,
"time_ms": 470,
"memory_kb": 36392,
"score_of_the_acc": -0.6331,
"final_rank": 6
},
{
"submission_id": "aoj_ALDS1_4_C_11017553",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <cmath>\nusing namespace std;\n\nbool isPrime(int a) {\n if (a <= 1) {\n return false;\n }\n if (a == 2) {\n return true;\n }\n if (a % 2 == 0) {\n return false;\n }\n int limit = static_cast<int>(std::sqrt(a)); \n for (int i = 3; i <= limit; i += 2) {\n if (a % i == 0) {\n return false;\n }\n }\n return true;\n}\n\nint findNextPrime(int b){\n int p = b + 1;\n while(!isPrime(p)){\n p += 1;\n }\n return p;\n}\n\nint h_1(long long key,int m){\n return key%m;\n}\n\nint h_2(long long key,int m){\n return (1 + (key%(m-1)));\n}\n\nint h_3(long long key, int i,int m){\n return ((h_1(key,m) + (long long)i*h_2(key,m))%m);\n}\n\nint ch_to_it(char ch){\n if(ch == 'A'){\n return 1;\n }else if(ch == 'C'){\n return 2;\n }else if(ch == 'G'){\n return 3;\n }else if(ch == 'T'){\n return 4;\n }\n}\n\nlong long ch_sm(string str){\n long long p = 1;\n long long sum = 0;\n for(char c: str){\n int x = ch_to_it(c);\n sum += p*x;\n p = p*5;\n }\n return sum;\n}\nvoid insert(string str,vector<string>& H,int m){\n long long key = ch_sm(str);\n for(int i = 0; i < m; i++){\n int hash1 = h_3(key,i,m);\n if(H[hash1].empty()){\n H[hash1] = str;\n return;\n }\n }\n}\n\nvoid find(string str,const vector<string>& H,int m){\n long long key = ch_sm(str);\n\n for(int i = 0; i < m; i++){\n int hash1 = h_3(key,i,m);\n if(H[hash1].empty()){\n cout << \"no\" << endl;\n return;\n }else if(H[hash1] == str){\n cout << \"yes\" << endl;\n return;\n }\n }\n cout << \"no\" << endl;\n}\n\nint main(){\n int n;\n cin >> n;\n\n int m = findNextPrime(n);\n vector<string> vec_str(m);\n\n string insfin,str;\n\n for(int i = 0; i <= (n-1); i++){\n cin >> insfin >> str;\n if(insfin == \"insert\"){\n insert(str,vec_str,m);\n }else if(insfin == \"find\"){\n find(str,vec_str,m);\n }\n }\n\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 760,
"memory_kb": 34368,
"score_of_the_acc": -0.7974,
"final_rank": 8
},
{
"submission_id": "aoj_ALDS1_4_C_11017508",
"code_snippet": "#include <iostream>\n#include <string>\n#include <cstring>\n#include <vector>\n#include <set>\n#define M 2000003\n#define L 14\nusing namespace std;\n\nchar H[M][L];\n\nint getChar(char ch){\n if (ch == 'A'){\n return 1;\n }else if(ch == 'C'){\n return 2;\n }else if(ch == 'G'){\n return 3;\n }else if(ch == 'T'){\n return 4;\n }\n return 0;\n}\n\nlong long getKey(char str[]){\n long long sum,p;\n sum = 0;\n p = 1;\n for(int i = 0; i < strlen(str); i++){\n sum += p*(getChar(str[i]));\n p *= 5;\n }\n return sum;\n}\n\nint h1(int key){\n int x;\n x = key % M;\n return x;\n}\n \nint h2(int key){\n int y;\n y = 1 + (key % (M-1));\n return y;\n}\n\nint find(char str[]){\n int hash,h_1,h_2,key;\n key = getKey(str);\n h_1 = h1(key);\n h_2 = h2(key);\n for(int i = 0;i < M; ++i){\n hash = (h_1 + i*h_2) % M;\n if(strcmp(H[hash],str) == 0){\n return 1;\n }\n }\n return 0;\n}\n\nint insert(char str[]){\n int hash,h_1,h_2,key;\n key = getKey(str);\n h_1 = h1(key);\n h_2 = h2(key);\n for(int i = 0;i < M; ++i){\n hash = (h_1 + i*h_2) % M;\n if(H[hash][0] == '\\0'){\n strcpy(H[hash],str);\n return 1;\n }\n }\n return 0;\n}\n\n\nint main(){\n int n,h;\n vector<int> result;\n char str[L+1], com[9];\n for(int i = 0; i < M; ++i){\n H[i][0] = '\\0';\n }\n\n cin >> n;\n\n for(int i = 0; i < n; ++i){\n cin >> com >> str;\n if(com[0] == 'i'){ \n //ๅ
ฅๅใinsertใชใ\n if (!find(str)){\n insert(str);\n }\n }else{\n //ๅ
ฅๅใfindใชใ\n if (find(str) == 1){\n result.push_back(1);\n }else{\n result.push_back(0);\n }\n }\n }\n for(int j = 0; j < result.size(); ++j){\n if (result[j] == 1){\n cout << \"yes\" << endl;\n }else{\n cout << \"no\" << endl;\n }\n }\n}",
"accuracy": 0.2,
"time_ms": 1150,
"memory_kb": 30688,
"score_of_the_acc": -1.0064,
"final_rank": 20
},
{
"submission_id": "aoj_ALDS1_4_C_11017505",
"code_snippet": "#include <iostream>\n#include <string>\n#include <cstring>\n#include <vector>\n#include <set>\n#define M 1000003\n#define L 14\nusing namespace std;\n\nchar H[M][L];\n\nint getChar(char ch){\n if (ch == 'A'){\n return 1;\n }else if(ch == 'C'){\n return 2;\n }else if(ch == 'G'){\n return 3;\n }else if(ch == 'T'){\n return 4;\n }\n return 0;\n}\n\nlong long getKey(char str[]){\n long long sum,p;\n sum = 0;\n p = 1;\n for(int i = 0; i < strlen(str); i++){\n sum += p*(getChar(str[i]));\n p *= 5;\n }\n return sum;\n}\n\nint h1(int key){\n int x;\n x = key % M;\n return x;\n}\n \nint h2(int key){\n int y;\n y = 1 + (key % (M-1));\n return y;\n}\n\nint find(char str[]){\n int hash,h_1,h_2,key;\n key = getKey(str);\n h_1 = h1(key);\n h_2 = h2(key);\n for(int i = 0;i < M; ++i){\n hash = (h_1 + i*h_2) % M;\n if(strcmp(H[hash],str) == 0){\n return 1;\n }\n }\n return 0;\n}\n\nint insert(char str[]){\n int hash,h_1,h_2,key;\n key = getKey(str);\n h_1 = h1(key);\n h_2 = h2(key);\n for(int i = 0;i < M; ++i){\n hash = (h_1 + i*h_2) % M;\n if(H[hash][0] == '\\0'){\n strcpy(H[hash],str);\n return 1;\n }\n }\n return 0;\n}\n\n\nint main(){\n int n,h;\n vector<int> result;\n char str[L+1], com[9];\n for(int i = 0; i < M; ++i){\n H[i][0] = '\\0';\n }\n\n cin >> n;\n\n for(int i = 0; i < n; ++i){\n cin >> com >> str;\n if(com[0] == 'i'){ \n //ๅ
ฅๅใinsertใชใ\n if (!find(str)){\n insert(str);\n }\n }else{\n //ๅ
ฅๅใfindใชใ\n if (find(str) == 1){\n result.push_back(1);\n }else{\n result.push_back(0);\n }\n }\n }\n for(int j = 0; j < result.size(); ++j){\n if (result[j] == 1){\n cout << \"yes\" << endl;\n }else{\n cout << \"no\" << endl;\n }\n }\n}",
"accuracy": 0.2,
"time_ms": 490,
"memory_kb": 17108,
"score_of_the_acc": -0.4057,
"final_rank": 19
},
{
"submission_id": "aoj_ALDS1_4_C_11017498",
"code_snippet": "#include <iostream>\n#include <string>\n#include <cstring>\n#include <vector>\n#include <set>\n#define M 1000003\n#define L 14\nusing namespace std;\n\nchar H[M][L];\n\nint getChar(char ch){\n if (ch == 'A'){\n return 1;\n }else if(ch == 'C'){\n return 2;\n }else if(ch == 'G'){\n return 3;\n }else if(ch == 'T'){\n return 4;\n }\n return 0;\n}\n\nlong long getKey(char str[]){\n long long sum,p;\n sum = 0;\n p = 1;\n for(int i = 0; i < strlen(str); i++){\n sum += p*(getChar(str[i]));\n p *= 5;\n }\n return sum;\n}\n\nint h1(int key){\n int x;\n x = key % M;\n return x;\n}\n \nint h2(int key){\n int y;\n y = 1 + (key % (M-1));\n return y;\n}\n\nint find(char str[]){\n int hash,h_1,h_2,key;\n key = getKey(str);\n h_1 = h1(key);\n h_2 = h2(key);\n for(int i = 0;i < M; ++i){\n hash = (h_1 + i*h_2) % M;\n if(strcmp(H[hash],str) == 0){\n return 1;\n }\n }\n return 0;\n}\n\nint insert(char str[]){\n int hash,h_1,h_2,key;\n key = getKey(str);\n h_1 = h1(key);\n h_2 = h2(key);\n for(int i = 0;i < M; ++i){\n hash = (h_1 + i*h_2) % M;\n if(H[hash][0] == '\\0'){\n strcpy(H[hash],str);\n return 1;\n }\n }\n return 0;\n}\n\n\nint main(){\n int n,h;\n vector<int> result;\n char str[L], com[9];\n for(int i = 0; i < M; ++i){\n H[i][0] = '\\0';\n }\n\n cin >> n;\n\n for(int i = 0; i < n; ++i){\n cin >> com >> str;\n if(com[0] == 'i'){ \n //ๅ
ฅๅใinsertใชใ\n if (!find(str)){\n insert(str);\n }\n }else{\n //ๅ
ฅๅใfindใชใ\n if (find(str) == 1){\n result.push_back(1);\n }else{\n result.push_back(0);\n }\n }\n }\n for(int j = 0; j < result.size(); ++j){\n if (result[j] == 1){\n cout << \"yes\" << endl;\n }else{\n cout << \"no\" << endl;\n }\n }\n}",
"accuracy": 0.2,
"time_ms": 480,
"memory_kb": 17116,
"score_of_the_acc": -0.3993,
"final_rank": 17
},
{
"submission_id": "aoj_ALDS1_4_C_11017288",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n\nlong long hs(long long x, int m, int i){\n long long h1 = x % m;\n long long h2 = 1 + x % (m - 1);\n return (h1 + i * h2) % m;\n}\n\nlong long encode(const string& s){\n long long val = 0;\n for (char c : s){\n val *= 5;\n switch(c){\n case 'A': val += 1; break;\n case 'T': val += 2; break;\n case 'G': val += 3; break;\n case 'C': val += 4; break;\n }\n }\n return val;\n}\n\nint main(){\n int n;\n string cmd, s;\n cin >> n;\n vector<long long> H(n, 0);\n vector<string> A;\n\n for (int i=0; i<n; i++){\n cin >> cmd >> s;\n long long x = encode(s);\n\n if (cmd == \"insert\"){\n for (int j=0; j<n; j++){\n long long h = hs(x, n, j);\n if (H[h]==0){\n H[h] = x;\n break;\n }\n if (H[h]==x) break; // ๆขใซๅญๅจใใๅ ดๅใฏๆฟๅ
ฅใใชใ\n }\n }else{ // find\n bool found = false;\n for (int j=0; j<n; j++){\n long long h = hs(x, n, j);\n if (H[h]==0) break; // ็ฉบใปใซใซๅฝใใฃใใ็ตไบ\n if (H[h]==x){\n A.push_back(\"yes\");\n found = true;\n break;\n }\n }\n if (!found) A.push_back(\"no\");\n }\n }\n\n for (string& ans : A){\n cout << ans << endl;\n }\n}",
"accuracy": 1,
"time_ms": 650,
"memory_kb": 28736,
"score_of_the_acc": -0.6553,
"final_rank": 7
},
{
"submission_id": "aoj_ALDS1_4_C_11017287",
"code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n\nlong long hs(long long x, int m, int i){\n long long h1 = x%m;\n long long h2 = 1+x%(m-1);\n long long h;\n h = (h1 + i * h2) % m;\n return h;\n}\n\nint main(){\n int n;\n string cmd, s;\n cin >> n;\n vector<int> H(n);\n vector<string> A;\n for (int i=0;i<n;i++){\n cin >> cmd >> s;\n string s2=\"\";\n for (char i:s){\n switch(i){\n case 'A': s2.push_back('1'); break;\n case 'T': s2.push_back('2'); break;\n case 'G': s2.push_back('3'); break;\n case 'C': s2.push_back('4'); break;\n }\n }\n long long x = stoll(s2);\n int j=0;\n if (cmd == \"insert\"){\n for(int l=0;l<n;l++){\n long long h = hs(x, n, j);\n if (H[h]==0){\n H[h] = x;\n break;\n }\n j+=1;\n }\n }else{\n bool found = false;\n for (int j=0;j<n;j++){\n long long h = hs(x, n, j);\n if (H[h]==0) break;\n if (H[h]==x){\n //Yes\n A.push_back(\"yes\");\n found = true;\n break;\n }\n }\n if (!found) A.push_back(\"no\");\n }\n }\n for (int k=0;k<A.size();k++){\n cout << A[k] << endl;\n }\n}",
"accuracy": 0.8,
"time_ms": 710,
"memory_kb": 24972,
"score_of_the_acc": -0.6476,
"final_rank": 13
},
{
"submission_id": "aoj_ALDS1_4_C_11017209",
"code_snippet": "#include <iostream>\n#include <stdio.h>\n#include <cstdlib>\n#include <cstring> \n#include <unordered_set>\n\nusing namespace std;\n\n\nint main(){\n int n,i,k,f;\n cin >> n;\n string fnc[n];\n string val[n];\n unordered_set<string> dex;\n \n for (i=0;i<n;i++){\n cin >> fnc[i] >> val[i];\n }\n \n \n for (i=0;i<n;i++){\n if (fnc[i]==\"insert\"){\n dex.insert(val[i]);\n }\n \n \n if (fnc[i]==\"find\"){\n if (dex.count(val[i])){\n cout << \"yes\" << endl;\n } else {\n cout << \"no\" << endl;\n }\n }\n }\n \n return 0;\n}",
"accuracy": 1,
"time_ms": 700,
"memory_kb": 86260,
"score_of_the_acc": -1.4052,
"final_rank": 9
},
{
"submission_id": "aoj_ALDS1_4_C_11017166",
"code_snippet": "#include <iostream>\n#include <string>\n#include <cstring>\n#include <vector>\n#include <set>\n#define M 100003\n#define L 100\nusing namespace std;\n\nchar H[M][L];\n\nint getChar(char ch){\n if (ch == 'A'){\n return 1;\n }else if(ch == 'C'){\n return 2;\n }else if(ch == 'G'){\n return 3;\n }else if(ch == 'T'){\n return 4;\n }\n return 0;\n}\n\nlong long getKey(char str[]){\n long long sum,p;\n sum = 0;\n p = 1;\n for(int i = 0; i < strlen(str); i++){\n sum += p*(getChar(str[i]));\n p *= 5;\n }\n return sum;\n}\n\nint h1(int key){\n int h1;\n h1 = key % M;\n return h1;\n}\n \nint h2(int key){\n int h2;\n h2 = 1 + (key % (M-1));\n return h2;\n}\n\nint find(char str[]){\n int hash,h_1,h_2,key;\n key = getKey(str);\n h_1 = h1(key);\n h_2 = h2(key);\n for(int i = 0;i < L; ++i){\n hash = (h_1 + i*h_2) % M;\n if(strcmp(H[hash],str) == 0){\n return 1;\n }\n }\n return 0;\n}\n\nint insert(char str[]){\n int hash,h_1,h_2,key;\n key = getKey(str);\n h_1 = h1(key);\n h_2 = h2(key);\n for(int i = 0;i < L; ++i){\n hash = (h_1 + i*h_2) % M;\n if(H[hash][0] == '\\0'){\n strcpy(H[hash],str);\n return 1;\n }\n }\n return 0;\n}\n\n\nint main(){\n int n,h;\n vector<int> result;\n char str[L], com[9];\n for(int i = 0; i < M; ++i){\n H[i][0] = '\\0';\n }\n\n cin >> n;\n\n for(int i = 0; i < n; ++i){\n cin >> com >> str;\n if(com[0] == 'i'){ \n //ๅ
ฅๅใinsertใชใ\n if (!find(str)){\n insert(str);\n }\n }else{\n //ๅ
ฅๅใfindใชใ\n if (find(str) == 1){\n result.push_back(1);\n }else{\n result.push_back(0);\n }\n }\n }\n for(int j = 0; j < result.size(); ++j){\n if (result[j] == 1){\n cout << \"yes\" << endl;\n }else{\n cout << \"no\" << endl;\n }\n }\n}",
"accuracy": 0.8,
"time_ms": 970,
"memory_kb": 14904,
"score_of_the_acc": -0.692,
"final_rank": 14
},
{
"submission_id": "aoj_ALDS1_4_C_11017160",
"code_snippet": "#include <iostream>\n#include <string>\n#include <cstring>\n#include <vector>\n#include <set>\n#define M 78583\n#define L 200\nusing namespace std;\n\nchar H[M][L];\n\nint getChar(char ch){\n if (ch == 'A'){\n return 1;\n }else if(ch == 'C'){\n return 2;\n }else if(ch == 'G'){\n return 3;\n }else if(ch == 'T'){\n return 4;\n }\n return 0;\n}\n\nlong long getKey(char str[]){\n long long sum,p;\n sum = 0;\n p = 1;\n for(int i = 0; i < strlen(str); i++){\n sum += p*(getChar(str[i]));\n p *= 5;\n }\n return sum;\n}\n\nint h1(int key){\n int h1;\n h1 = key % M;\n return h1;\n}\n \nint h2(int key){\n int h2;\n h2 = 1 + (key % (M-1));\n return h2;\n}\n\nint find(char str[]){\n int hash,h_1,h_2,key;\n key = getKey(str);\n h_1 = h1(key);\n h_2 = h2(key);\n for(int i = 0;i < L; ++i){\n hash = (h_1 + i*h_2) % M;\n if(strcmp(H[hash],str) == 0){\n return 1;\n }\n }\n return 0;\n}\n\nint insert(char str[]){\n int hash,h_1,h_2,key;\n key = getKey(str);\n h_1 = h1(key);\n h_2 = h2(key);\n for(int i = 0;i < L; ++i){\n hash = (h_1 + i*h_2) % M;\n if(H[hash][0] == '\\0'){\n strcpy(H[hash],str);\n return 1;\n }\n }\n return 0;\n}\n\n\nint main(){\n int n,h;\n vector<int> result;\n char str[L], com[9];\n for(int i = 0; i < M; ++i){\n H[i][0] = '\\0';\n }\n\n cin >> n;\n\n for(int i = 0; i < n; ++i){\n cin >> com >> str;\n if(com[0] == 'i'){ \n //ๅ
ฅๅใinsertใชใ\n if (!find(str)){\n insert(str);\n }\n }else{\n //ๅ
ฅๅใfindใชใ\n if (find(str) == 1){\n result.push_back(1);\n }else{\n result.push_back(0);\n }\n }\n }\n for(int j = 0; j < result.size(); ++j){\n if (result[j] == 1){\n cout << \"yes\" << endl;\n }else{\n cout << \"no\" << endl;\n }\n }\n}",
"accuracy": 0.8,
"time_ms": 1610,
"memory_kb": 20304,
"score_of_the_acc": -1.1776,
"final_rank": 16
},
{
"submission_id": "aoj_ALDS1_4_C_11017154",
"code_snippet": "#include <iostream>\n#include <string>\n#include <cstring>\n#include <vector>\n#include <set>\n#define M 78583\n#define L 100\nusing namespace std;\n\nchar H[M][L];\n\nint getChar(char ch){\n if (ch == 'A'){\n return 1;\n }else if(ch == 'C'){\n return 2;\n }else if(ch == 'G'){\n return 3;\n }else if(ch == 'T'){\n return 4;\n }\n return 0;\n}\n\nlong long getKey(char str[]){\n long long sum,p;\n sum = 0;\n p = 1;\n for(int i = 0; i < strlen(str); i++){\n sum += p*(getChar(str[i]));\n p *= 5;\n }\n return sum;\n}\n\nint h1(int key){\n int h1;\n h1 = key % M;\n return h1;\n}\n \nint h2(int key){\n int h2;\n h2 = 1 + (key % (M-1));\n return h2;\n}\n\nint find(char str[]){\n int hash,h_1,h_2,key;\n key = getKey(str);\n h_1 = h1(key);\n h_2 = h2(key);\n for(int i = 0;i < L; ++i){\n hash = (h_1 + i*h_2) % M;\n if(strcmp(H[hash],str) == 0){\n return 1;\n }\n }\n return 0;\n}\n\nint insert(char str[]){\n int hash,h_1,h_2,key;\n key = getKey(str);\n h_1 = h1(key);\n h_2 = h2(key);\n for(int i = 0;i < L; ++i){\n hash = (h_1 + i*h_2) % M;\n if(H[hash][0] == '\\0'){\n strcpy(H[hash],str);\n return 1;\n }\n }\n return 0;\n}\n\n\nint main(){\n int n,h;\n vector<int> result;\n char str[L], com[9];\n for(int i = 0; i < M; ++i){\n H[i][0] = '\\0';\n }\n\n cin >> n;\n\n for(int i = 0; i < n; ++i){\n cin >> com >> str;\n if(com[0] == 'i'){ \n //ๅ
ฅๅใinsertใชใ\n if (!find(str)){\n insert(str);\n }\n }else{\n //ๅ
ฅๅใfindใชใ\n if (find(str) == 1){\n result.push_back(1);\n }else{\n result.push_back(0);\n }\n }\n }\n for(int j = 0; j < result.size(); ++j){\n if (result[j] == 1){\n cout << \"yes\" << endl;\n }else{\n cout << \"no\" << endl;\n }\n }\n}",
"accuracy": 0.8,
"time_ms": 1060,
"memory_kb": 12760,
"score_of_the_acc": -0.7241,
"final_rank": 15
},
{
"submission_id": "aoj_ALDS1_4_C_11017151",
"code_snippet": "#include <iostream>\n#include <string>\n#include <cstring>\n#include <vector>\n#include <set>\n#define M 78583\n#define L 20\nusing namespace std;\n\nchar H[M][L];\n\nint getChar(char ch){\n if (ch == 'A'){\n return 1;\n }else if(ch == 'C'){\n return 2;\n }else if(ch == 'G'){\n return 3;\n }else if(ch == 'T'){\n return 4;\n }\n return 0;\n}\n\nlong long getKey(char str[]){\n long long sum,p;\n sum = 0;\n p = 1;\n for(int i = 0; i < strlen(str); i++){\n sum += p*(getChar(str[i]));\n p *= 5;\n }\n return sum;\n}\n\nint h1(int key){\n int h1;\n h1 = key % M;\n return h1;\n}\n \nint h2(int key){\n int h2;\n h2 = 1 + (key % (M-1));\n return h2;\n}\n\nint find(char str[]){\n int hash,h_1,h_2,key;\n key = getKey(str);\n h_1 = h1(key);\n h_2 = h2(key);\n for(int i = 0;i < L; ++i){\n hash = (h_1 + i*h_2) % M;\n if(strcmp(H[hash],str) == 0){\n return 1;\n }\n }\n return 0;\n}\n\nint insert(char str[]){\n int hash,h_1,h_2,key;\n key = getKey(str);\n h_1 = h1(key);\n h_2 = h2(key);\n for(int i = 0;i < L; ++i){\n hash = (h_1 + i*h_2) % M;\n if(H[hash][0] == '\\0'){\n strcpy(H[hash],str);\n return 1;\n }\n }\n return 0;\n}\n\n\nint main(){\n int n,h;\n vector<int> result;\n char str[L], com[9];\n for(int i = 0; i < M; ++i){\n H[i][0] = '\\0';\n }\n\n cin >> n;\n\n for(int i = 0; i < n; ++i){\n cin >> com >> str;\n if(com[0] == 'i'){ \n //ๅ
ฅๅใinsertใชใ\n if (!find(str)){\n insert(str);\n }\n }else{\n //ๅ
ฅๅใfindใชใ\n if (find(str) == 1){\n result.push_back(1);\n }else{\n result.push_back(0);\n }\n }\n }\n for(int j = 0; j < result.size(); ++j){\n if (result[j] == 1){\n cout << \"yes\" << endl;\n }else{\n cout << \"no\" << endl;\n }\n }\n}",
"accuracy": 0.8,
"time_ms": 700,
"memory_kb": 7696,
"score_of_the_acc": -0.4256,
"final_rank": 12
},
{
"submission_id": "aoj_ALDS1_4_C_11017148",
"code_snippet": "#include <iostream>\n#include <string>\n#include <cstring>\n#include <vector>\n#include <set>\n#define M 78583\n#define L 14\nusing namespace std;\n\nchar H[M][L];\n\nint getChar(char ch){\n if (ch == 'A'){\n return 1;\n }else if(ch == 'C'){\n return 2;\n }else if(ch == 'G'){\n return 3;\n }else if(ch == 'T'){\n return 4;\n }\n return 0;\n}\n\nlong long getKey(char str[]){\n long long sum,p;\n sum = 0;\n p = 1;\n for(int i = 0; i < strlen(str); i++){\n sum += p*(getChar(str[i]));\n p *= 5;\n }\n return sum;\n}\n\nint h1(int key){\n int h1;\n h1 = key % M;\n return h1;\n}\n \nint h2(int key){\n int h2;\n h2 = 1 + (key % (M-1));\n return h2;\n}\n\nint find(char str[]){\n int hash,h_1,h_2,key;\n key = getKey(str);\n h_1 = h1(key);\n h_2 = h2(key);\n for(int i = 0;i < L; ++i){\n hash = (h_1 + i*h_2) % M;\n if(strcmp(H[hash],str) == 0){\n return 1;\n }\n }\n return 0;\n}\n\nint insert(char str[]){\n int hash,h_1,h_2,key;\n key = getKey(str);\n h_1 = h1(key);\n h_2 = h2(key);\n for(int i = 0;i < L; ++i){\n hash = (h_1 + i*h_2) % M;\n if(H[hash][0] == '\\0'){\n strcpy(H[hash],str);\n return 1;\n }\n }\n return 0;\n}\n\n\nint main(){\n int n,h;\n vector<int> result;\n char str[L], com[9];\n for(int i = 0; i < M; ++i){\n H[i][0] = '\\0';\n }\n\n cin >> n;\n\n for(int i = 0; i < n; ++i){\n cin >> com >> str;\n if(com[0] == 'i'){ \n //ๅ
ฅๅใinsertใชใ\n if (!find(str)){\n insert(str);\n }\n }else{\n //ๅ
ฅๅใfindใชใ\n if (find(str) == 1){\n result.push_back(1);\n }else{\n result.push_back(0);\n }\n }\n }\n for(int j = 0; j < result.size(); ++j){\n if (result[j] == 1){\n cout << \"yes\" << endl;\n }else{\n cout << \"no\" << endl;\n }\n }\n}",
"accuracy": 0.8,
"time_ms": 670,
"memory_kb": 6212,
"score_of_the_acc": -0.3875,
"final_rank": 10
},
{
"submission_id": "aoj_ALDS1_4_C_11017113",
"code_snippet": "#include <iostream>\n#include <string>\n#include <cstring>\n#include <vector>\n#include <set>\n#define M 76927\n#define L 14\nusing namespace std;\n\nchar H[M][L];\n\nint getChar(char ch){\n if (ch == 'A'){\n return 1;\n }else if(ch == 'C'){\n return 2;\n }else if(ch == 'G'){\n return 3;\n }else if(ch == 'T'){\n return 4;\n }\n return 0;\n}\n\nlong long getKey(char str[]){\n long long sum,p;\n sum = 0;\n p = 1;\n for(int i = 0; i < strlen(str); i++){\n sum += p*(getChar(str[i]));\n p *= 5;\n }\n return sum;\n}\n\nint h1(int key){\n int h1;\n h1 = key % M;\n return h1;\n}\n \nint h2(int key){\n int h2;\n h2 = 1 + (key % (M-1));\n return h2;\n}\n\nint find(char str[]){\n int hash,h_1,h_2,key;\n key = getKey(str);\n h_1 = h1(key);\n h_2 = h2(key);\n for(int i = 0;i < L; ++i){\n hash = (h_1 + i*h_2) % M;\n if(strcmp(H[hash],str) == 0){\n return 1;\n }\n }\n return 0;\n}\n\nint insert(char str[]){\n int hash,h_1,h_2,key;\n key = getKey(str);\n h_1 = h1(key);\n h_2 = h2(key);\n for(int i = 0;i < L; ++i){\n hash = (h_1 + i*h_2) % M;\n if(H[hash][0] == '\\0'){\n strcpy(H[hash],str);\n return 1;\n }\n }\n return 0;\n}\n\n\nint main(){\n int n,h;\n vector<int> result;\n char str[L], com[9];\n for(int i = 0; i < M; ++i){\n H[i][0] = '\\0';\n }\n\n cin >> n;\n\n for(int i = 0; i < n; ++i){\n cin >> com >> str;\n if(com[0] == 'i'){ \n //ๅ
ฅๅใinsertใชใ\n if (!find(str)){\n insert(str);\n }\n }else{\n //ๅ
ฅๅใfindใชใ\n if (find(str) == 1){\n result.push_back(1);\n }else{\n result.push_back(0);\n }\n }\n }\n for(int j = 0; j < result.size(); ++j){\n if (result[j] == 1){\n cout << \"yes\" << endl;\n }else{\n cout << \"no\" << endl;\n }\n }\n}",
"accuracy": 0.8,
"time_ms": 690,
"memory_kb": 6060,
"score_of_the_acc": -0.3987,
"final_rank": 11
}
] |
aoj_ALDS1_4_B_cpp
|
Search II
You are given a sequence of
n
integers S and a sequence of different
q
integers T. Write a program which outputs C, the number of integers in T which are also in the set S.
Input
In the first line
n
is given. In the second line,
n
integers are given. In the third line
q
is given. Then, in the fourth line,
q
integers are given.
Output
Print C in a line.
Constraints
Elements in S is sorted in ascending order
n โค 100000
q โค 50000
0 โค an element in S โค 10
9
0 โค an element in T โค 10
9
Sample Input 1
5
1 2 3 4 5
3
3 4 1
Sample Output 1
3
Sample Input 2
3
1 2 3
1
5
Sample Output 2
0
Sample Input 3
5
1 1 2 2 3
2
1 2
Sample Output 3
2
Notes
|
[
{
"submission_id": "aoj_ALDS1_4_B_11066403",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n\nint main() {\n int n,q; cin>>n;\n int s[n+5], t;\n int count=0;\n\n for(int i =1; i<=n;i++){\n cin>>s[i];\n }\n cin>>q;\n for(int i=1;i<=q;i++){\n cin>>t;\n int l = 1, r=n; \n while(l <= r){\n int mid = (l+r)/2;\n if(t == s[mid]){\n count++;\n break;\n }\n else if(t < s[mid]) {\n r = mid-1;\n }\n else {\n l = mid + 1;\n }\n }\n }\n cout<<count<<endl;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3516,
"score_of_the_acc": -0.5605,
"final_rank": 7
},
{
"submission_id": "aoj_ALDS1_4_B_11036791",
"code_snippet": "#ifndef ONLINE_JUDGE\n#define _GLIBCXX_DEBUG\n#endif\n#include <bits/stdc++.h>\nusing namespace std;\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\nusing ll = long long;\nusing ld = long double;\nll inf = 2e18;\n#define rep(i,n) for(ll i = 0; i < (n); i++)\n#define all(x) x.begin(), x.end()\n#define rall(x) x.rbegin(), x.rend()\n#define el '\\n'\n#define sp \" \"\n#define Yes cout << \"Yes\" << el\n#define No cout << \"No\" << el\n#define YN {cout<<\"Yes\"<<endl;}else{cout<<\"No\"<<endl;}\n#define next_p(v) next_permutation(v.begin(),v.end())\n#define mod(a,d) (a%d+d)%d\nvector<ll> dx = { 1,0,-1,0 };\nvector<ll> dy = { 0,1,0,-1 };\nbool out_grid(ll i, ll j, ll h, ll w) {//trueใชใcontinue\n return (!(0 <= i && i < h && 0 <= j && j < w));\n}\n\nvoid solve(){\n\n ll n;\n cin >> n;\n vector<ll> s(n);\n rep(i,n) cin >> s[i];\n ll q;\n cin >> q;\n vector<ll> t(q);\n rep(i,q) cin >> t[i];\n\n ll ans = 0;\n rep(i,q){\n ll target = t[i];\n ll left = 0;\n ll right = n-1;\n if(s[left]==target){\n ans ++;\n continue;\n }\n if(s[right]==target){\n ans ++;\n continue;\n }\n ll key = 0;\n while(right-left>1){\n ll mid = left + (right-left)/2;\n if(s[mid]==target){\n ans ++;\n key = 1;\n break;\n }else if(s[mid]>target){\n right = mid;\n }else{\n left = mid;\n }\n }\n if(key==0) continue;\n }\n\n cout << ans << el;\n\n}\n\nint main(){\n\n ll t = 1;\n //cin >> t;\n rep(i,t) solve();\n\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 4104,
"score_of_the_acc": -0.8007,
"final_rank": 17
},
{
"submission_id": "aoj_ALDS1_4_B_11021855",
"code_snippet": "#include <iostream> // cout, endl, cin\n#include <string> // string, to_string, stoi\n#include <vector> // vector\n#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound\n#include <utility> // pair, make_pair\n#include <tuple> // tuple, make_tuple\n#include <cstdint> // int64_t, int*_t\n#include <cstdio> // printf\n#include <map> // map\n#include <queue> // queue, priority_queue\n#include <set> // set\n#include <stack> // stack\n#include <deque> // deque\n#include <unordered_map> // unordered_map\n#include <unordered_set> // unordered_set\n#include <bitset> // bitset\n#include <cctype> // isupper, islower, isdigit, toupper, tolower\n#include <cmath> // sqrt\n\nusing namespace std;\n\n// ไบๅๆข็ดข\nint main() {\n int n;\n cin >> n;\n vector<int64_t> s(n);\n for(int i = 0; i < n; i++){\n cin >> s.at(i);\n }\n\n int q;\n cin >> q;\n\n int ans = 0;\n for(int i = 0; i < q; i++){\n int64_t t;\n cin >> t;\n\n int left = 0;\n int right = n;\n while(left < right){\n // cout << \"be:\" << left << \" \" << right << endl;\n int mid = (left + right)/2;\n if(t == s.at(mid)){\n ans++;\n break;\n }else if(t < s.at(mid)){\n right = mid;\n }else if(t > s.at(mid)){\n left = mid + 1;\n }\n // cout << \"af:\" << left << \" \" << right << endl;\n }\n }\n\n cout << ans << endl;\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3768,
"score_of_the_acc": -0.6634,
"final_rank": 14
},
{
"submission_id": "aoj_ALDS1_4_B_11017787",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cmath>\nusing namespace std;\nint main(){\n int n,q,count,key;\n \n cin >> n;\n vector<int> S(n);\n for(int i = 0;i < n; ++i){\n cin >> S[i];\n }\n\n cin >> q;\n vector<int> T(q);\n for(int j = 0; j < q; ++j){\n cin >> T[j];\n }\n\n int left,right,mid;\n count = 0;\n\n for(int k = 0; k <= q-1; ++k){\n left = 0;\n right = n;\n key = T[k];\n while(left < right){\n mid = (left + right)/2;\n if(S[mid] == key){\n count += 1;\n break;\n }else if(key < S[mid]){\n right = mid;\n }else {\n left = mid +1;\n } \n }\n }\n cout << count << endl;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3436,
"score_of_the_acc": -0.5278,
"final_rank": 3
},
{
"submission_id": "aoj_ALDS1_4_B_11017656",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint a[1000000];\nint main(void){\n int n,m,ans=0;\n cin>>n;\n for(int i=0;i<n;i++){\n int b;\n cin>>b;\n a[b%1000000]=1;\n }\n cin>>m;\n for(int i=0;i<m;i++){\n int b;\n cin>>b;\n ans+=a[b%1000000];\n }\n cout<<ans<<endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3368,
"score_of_the_acc": -0.5,
"final_rank": 1
},
{
"submission_id": "aoj_ALDS1_4_B_11017593",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nint main(){\n long long n;\n cin >> n;\n long long S[n];\n for(long long i=0; i<n; ++i){\n cin >> S[i];\n }\n long long q;\n cin >> q;\n long long T[q];\n for(long long i=0; i<q; ++i){\n cin >> T[i];\n }\n\n long long _count = 0;\n\n for(int i=0; i<q; ++i){\n if((S[0] <= T[i]) || (T[i] <= S[n-1])){\n long long left = 0;\n long long right = n;\n for(long long mid=(left+right)/2; S[mid]!=T[i];mid=(left+right)/2){\n if(T[i]<S[mid]){\n right = mid;\n }\n else left = mid+1;\n if(mid==(left+right)/2){\n --_count; break;\n }\n }\n ++_count;\n }\n }\n\n cout << _count << endl;\n \n \n\n return 0;\n}",
"accuracy": 1,
"time_ms": 10,
"memory_kb": 4608,
"score_of_the_acc": -0.5065,
"final_rank": 2
},
{
"submission_id": "aoj_ALDS1_4_B_11017577",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cmath>\nusing namespace std;\nint main(){\n int n,q,count,key;\n \n cin >> n;\n vector<int> S(n);\n for(int i = 0;i < n; ++i){\n cin >> S[i];\n }\n\n cin >> q;\n vector<int> T(q);\n for(int j = 0; j < q; ++j){\n cin >> T[j];\n }\n\n int left,right,mid;\n count = 0;\n\n for(int k = 0; k <= q-1; ++k){\n left = 0;\n right = n;\n key = T[k];\n while(left < right){\n mid = (left + right)/2;\n if(S[mid] == key){\n count += 1;\n break;\n }else if(key < S[mid]){\n right = mid;\n }else {\n left = mid +1;\n } \n }\n }\n cout << count << endl;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3472,
"score_of_the_acc": -0.5425,
"final_rank": 5
},
{
"submission_id": "aoj_ALDS1_4_B_11017108",
"code_snippet": "#include <iostream>\n#include <stdio.h>\n#include <cstdlib>\n#include <cstring> \n#include <cmath>\n\nusing namespace std;\n\nint main(){\n int n;\n int S[100000];\n int q;\n int T[50000];\n \n int i;\n int F=0;\n \n cin >> n;\n for (i=0;i<n;i++){\n cin >> S[i];\n }\n cin >> q;\n for (i=0;i<q;i++){\n cin >> T[i];\n }\n\n F=0;\n float L=0;\n float R=n-1;\n int M;\n int M2=-1;\n int A=0;\n M=floor((L+R)/2);\n \n for (i=0;i<q;i++){\n F = 0;\n L=0;\n R=n-1;\n M=floor((L+R)/2);\n M2=-1;\n \n \n while(F==0){\n if (S[M]==T[i]){\n A = A + 1;\n F=1;\n } else if(S[M]<T[i]){\n L=M+1;\n M=floor((L+R)/2);\n F=0;\n } else {\n R=M-1;\n M=floor((L+R)/2);\n F=0;\n }\n if (F==0 and M==M2){\n F=1;\n }\n M2=M;\n }\n }\n\n\n\n cout << A << endl; \n\n\n\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 30,
"memory_kb": 3948,
"score_of_the_acc": -1.2369,
"final_rank": 18
},
{
"submission_id": "aoj_ALDS1_4_B_11017081",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\n// ไบๅๆข็ดข๏ผ้ๅบ้็๏ผ\nbool binarySearch(const vector<int>& A, int key) {\n int left = 0;\n int right = A.size() - 1;\n while (left <= right) {\n int mid = (left + right) / 2;\n if (A[mid] == key) return true;\n else if (key < A[mid]) right = mid - 1;\n else left = mid + 1;\n }\n return false;\n}\n\nint main() {\n int n, q;\n cin >> n;\n vector<int> S(n);\n for (int i = 0; i < n; i++) cin >> S[i];\n\n cin >> q;\n vector<int> T(q);\n for (int i = 0; i < q; i++) cin >> T[i];\n\n int count = 0;\n for (int i = 0; i < q; i++) {\n if (binarySearch(S, T[i])) count++;\n }\n\n cout << count << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3536,
"score_of_the_acc": -0.5686,
"final_rank": 9
},
{
"submission_id": "aoj_ALDS1_4_B_11016105",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint binary_search(int v[],int n,int target){\n //ใคใณใใใฏในใๅใฅใใ\n int left = 0;\n int right = n-1;\n while(left<=right){\n int mid = (left+right)/2;\n if(target==v[mid])return mid;\n if(target<v[mid]){\n right = mid-1;\n }\n else{\n left = mid+1;\n }\n }\n return -1;\n}\n\n\nint main(){\n int n;cin >> n;\n vector<int>x(n);\n for(int i=0;i<n;i++){\n cin >> x[i];\n }\n int m;cin >> m;\n vector<int>y(m);\n for(int i=0;i<m;i++){\n cin >> y[i];\n }\n \n sort(y.begin(),y.end());\n set<int>unique_x(x.begin(),x.end());\n int count=0;\n for(int val : unique_x){\n if(binary_search(y.data(), m, val) != -1) count++;\n }\n cout << count << endl;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 5668,
"score_of_the_acc": -1.4395,
"final_rank": 19
},
{
"submission_id": "aoj_ALDS1_4_B_11008335",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cmath>\nusing namespace std;\nint main(){\n int n,q,count,key;\n \n cin >> n;\n vector<int> S(n);\n for(int i = 0;i < n; ++i){\n cin >> S[i];\n }\n\n cin >> q;\n vector<int> T(q);\n for(int j = 0; j < q; ++j){\n cin >> T[j];\n }\n\n int left,right,mid;\n count = 0;\n\n for(int k = 0; k <= q-1; ++k){\n left = 0;\n right = n;\n key = T[k];\n while(left < right){\n mid = (left + right)/2;\n if(S[mid] == key){\n count += 1;\n break;\n }else if(key < S[mid]){\n right = mid;\n }else {\n left = mid +1;\n } \n }\n }\n cout << count << endl;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3536,
"score_of_the_acc": -0.5686,
"final_rank": 9
},
{
"submission_id": "aoj_ALDS1_4_B_11007265",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <unordered_set>\nusing namespace std;\n\nint main() {\n int n, q;\n cin >> n;\n vector<int> S(n);\n for (int i = 0; i < n; ++i) {\n cin >> S[i];\n }\n\n cin >> q;\n vector<int> T(q);\n for (int i = 0; i < q; ++i) {\n cin >> T[i];\n }\n\n unordered_set<int> s_set(S.begin(), S.end());\n int count = 0;\n for (int i = 0; i < q; ++i) {\n if (s_set.count(T[i])) {\n ++count;\n }\n }\n\n cout << count << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 5816,
"score_of_the_acc": -1.5,
"final_rank": 20
},
{
"submission_id": "aoj_ALDS1_4_B_11004772",
"code_snippet": "#include<iostream>\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n\n int S[n];\n for(int i=0;i<n;i++){\n cin >> S[i];\n //cout << S[i] << endl;\n }\n\n int q, m, mid;\n int count=0;\n int left=0;\n int right=n;\n cin >> q;\n\n int T[q];\n for(int i=0;i<q;i++){\n cin >> T[i];\n //cout << T[i] << endl;\n }\n\n for(int i=0;i<q;i++){\n m = T[i];\n left = 0;\n right = n;\n while(left < right){\n mid = (left+right)/2;\n if(m == S[mid]){\n count++;\n break;\n } else if(m < S[mid]){\n right = mid;\n } else{\n left = mid+1;\n }\n }\n }\n cout << count << endl;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3920,
"score_of_the_acc": -0.7255,
"final_rank": 15
},
{
"submission_id": "aoj_ALDS1_4_B_10998304",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\nint main()\n{\n int n, q, num, count = 0;\n cin >> n;\n vector<int> S, T;\n for (int i = 0; i < n; i++)\n {\n cin >> num;\n S.push_back(num);\n }\n cin >> q;\n for (int i = 0; i < q; i++)\n {\n cin >> num;\n T.push_back(num);\n }\n\n for (int i = 0; i < q; i++)\n {\n int left = 0;\n int right = n;\n int mid;\n int key = T[i];\n\n while (left < right)\n {\n mid = (left + right) / 2;\n\n if (S[mid] == key)\n {\n count++;\n break;\n }\n else if (S[mid] > key)\n {\n right = mid;\n }\n else\n\n {\n left = mid + 1;\n }\n }\n }\n cout << count << endl;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3684,
"score_of_the_acc": -0.6291,
"final_rank": 11
},
{
"submission_id": "aoj_ALDS1_4_B_10998246",
"code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\n\nint main(){\n int n,q;\n cin >> n;\n vector<int> S(n);\n\n for (int i=0;i<n;i++){\n cin >> S[i];\n }\n cin >> q;\n vector<int> T(q);\n for (int i=0;i<q;i++){\n cin >> T[i];\n }\n \n int C=0;\n for (int i=0;i<q;i++){\n int left=0, right=n;\n while (left<right){\n int mid=(left+right)/2;\n if (S[mid]==T[i]){\n C+=1;\n break;\n }\n else if(T[i]<S[mid]){\n right=mid;\n }\n else{\n left=mid+1;\n }\n }\n }\n \n cout << C << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3504,
"score_of_the_acc": -0.5556,
"final_rank": 6
},
{
"submission_id": "aoj_ALDS1_4_B_10998211",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n\nusing namespace std;\n\nbool Nibun_Tansaku(vector<int>&array, int N, int key,int&swap_count){\n int left = 0;\n int right = N-1;\n while(left <= right){\n swap_count ++;\n int mid = (left + right) / 2;\n if (array[mid] == key){\n return true;\n }else if(key < array[mid]){\n right = mid - 1;\n }else{\n left = mid + 1;\n }\n }\n return false;\n\n}\nint main(){\n int x;\n cin >> x;\n vector<int>S(x);\n for(int i = 0; i < x; i++ ){\n int n;\n cin >> n;\n S[i] = n;\n } \n sort(S.begin(), S.end());\n int y;\n cin >> y;\n vector<int>T(y);\n for(int j = 0; j < y; j++){\n int m;\n cin >> m;\n T[j] = m;\n }\n int match_count = 0;\n int swap_count = 0;\n for(int key : T){\n if (Nibun_Tansaku(S, x, key,swap_count)){\n match_count++;\n }\n }\n cout << match_count << endl;\n return 0;\n \n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3524,
"score_of_the_acc": -0.5637,
"final_rank": 8
},
{
"submission_id": "aoj_ALDS1_4_B_10998174",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n vector<int> S(n);\n for (int i =0; i<n; ++i){\n cin >> S[i];\n }\n int q;\n cin >> q;\n vector<int> T(q);\n for (int i=0; i<q; ++i){\n cin >> T[i];\n }\n sort(S.begin(), S.end());\n int count = 0;\n for (int i=0; i<q; ++i){\n int key = T[i];\n int left = 0;\n int right =n;\n bool found = false;\n \n while(left<right){\n int mid = (left + right)/2;\n if(S[mid] == key){\n found = true;\n break;\n }\n else if (key < S[mid]){\n right = mid;\n }\n else {\n left = mid + 1;\n }\n }\n if (found) ++count;\n }\n \n cout << count << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3440,
"score_of_the_acc": -0.5294,
"final_rank": 4
},
{
"submission_id": "aoj_ALDS1_4_B_10998087",
"code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\n\nint main(){\n vector<int> S,T;\n int SN,TN,sum=0;\n cin>>SN;\n for(int i=0;i<SN;i++){\n int tmp;\n cin >>tmp;\n S.push_back(tmp);\n }\n cin>>TN;\n for(int i=0;i<TN;i++){\n int tmp;\n cin >>tmp;\n T.push_back(tmp);\n }\n for(int i=0;i<TN;i++){\n int left = 0;\n int right = SN;\n while(left<right){\n int mid = (left+right)/2;\n if (S[mid]==T[i]){\n sum++;break;\n }else if(S[mid]<T[i]){\n left=mid+1;\n }else{\n right=mid;\n }\n }\n }\n cout<<sum<<endl;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3712,
"score_of_the_acc": -0.6405,
"final_rank": 12
},
{
"submission_id": "aoj_ALDS1_4_B_10998066",
"code_snippet": "using namespace std;\n#include <iostream>\n#include <algorithm>\n\n\nint binarySearch(int A[], int n, int key){\n int left = 0;\n int right = n;\n while (left < right){\n int mid = (left + right) / 2;\n if(A[mid] == key){\n return mid;\n }\n else if (key < A[mid]){\n right = mid;\n }else{\n left = mid + 1;\n }\n }\n return -1;\n}\n \nint main(){\n int n;\n cin >> n;\n int S[n];\n for(int i; i < n; i++){\n cin >> S[i];\n }\n int q;\n cin >> q;\n int T[q];\n for(int i; i < q; i++){\n cin >> T[i];\n }\n int a = 0;\n for(int i = 0; i < q; i++){\n if (binarySearch(S, n, T[i]) != -1) {\n a++;\n }\n }\n cout << a << endl;\n return 0;\n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3928,
"score_of_the_acc": -0.7288,
"final_rank": 16
},
{
"submission_id": "aoj_ALDS1_4_B_10998055",
"code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\n\nint A[10000000],n;\n\nint binarySearch(int key){\n int left = 0;\n int right = n;\n int mid;\n while(left < right){\n mid = (left + right)/2;\n if(A[mid]==key) return mid;\n if(key<A[mid])right=mid;\n else if(key>A[mid])left=mid+1;\n }\n return 0;\n}\n\nint main(){\n int i,q,k,sum=0;\n cin >> n;\n for(i=0;i<n;i++){\n cin >> A[i];\n }\n \n cin >> q;\n for(i=0;i<q;i++){\n cin >> k;\n if(binarySearch(k)) \n sum++;\n }\n cout << sum << endl;\n \n return 0;\n \n}",
"accuracy": 1,
"time_ms": 20,
"memory_kb": 3732,
"score_of_the_acc": -0.6487,
"final_rank": 13
}
] |
aoj_ALDS1_3_C_cpp
|
Doubly Linked List
Your task is to implement a double linked list.
Write a program which performs the following operations:
insert x: insert an element with key x into the front of the list.
delete x: delete the first element which has the key of x from the list. If there is not such element, you need not do anything.
deleteFirst: delete the first element from the list.
deleteLast: delete the last element from the list.
Input
The input is given in the following format:
n
command
1
command
2
...
command
n
In the first line, the number of operations
n
is given. In the following
n
lines, the above mentioned operations are given in the following format:
insert x
delete x
deleteFirst
deleteLast
Output
Print all the element (key) in the list after the given operations. Two consequtive keys should be separated by a single space.
Constraints
The number of operations โค 2,000,000
The number of delete operations โค 20
0 โค value of a key โค 10
9
The number of elements in the list does not exceed 10
6
For a delete, deleteFirst or deleteLast operation, there is at least one element in the list.
Sample Input 1
7
insert 5
insert 2
insert 3
insert 1
delete 3
insert 6
delete 5
Sample Output 1
6 1 2
Sample Input 2
9
insert 5
insert 2
insert 3
insert 1
delete 3
insert 6
delete 5
deleteFirst
deleteLast
Sample Output 2
1
|
[
{
"submission_id": "aoj_ALDS1_3_C_11042443",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint n, x;\nstring s;\nlist<int> l;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0); cout.tie(0);\n\n cin >> n;\n while(n--) {\n cin >> s;\n if(s == \"insert\") {\n cin >> x;\n l.push_front(x);\n }else if(s == \"delete\") {\n cin >> x;\n for(auto it = l.begin(); it != l.end(); it++) {\n if(*it == x) {\n l.erase(it);\n break;\n }\n }\n }else if(s == \"deleteFirst\") l.pop_front();\n else l.pop_back();\n }\n\n for(auto it = l.begin(); it != l.end();) {\n cout << *it;\n if(++it != l.end()) cout << ' ';\n }\n cout << '\\n';\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 34648,
"score_of_the_acc": -0.7448,
"final_rank": 7
},
{
"submission_id": "aoj_ALDS1_3_C_11014277",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define ld long double\n#define all(x) x.begin(), x.end()\n\n\nvoid solaiman(){\n int n; cin >> n;\n\n deque<int> dq;\n while(n--){\n string s; cin >> s;\n if(s == \"insert\"){\n int x; cin >> x;\n dq.push_front(x);\n }\n else if(s == \"delete\"){\n int x; cin >> x;\n\n if(!dq.empty()){\n auto it = find(dq.begin(), dq.end(), x);\n\n if(it != dq.end()){\n dq.erase(it);\n }\n }\n }\n else if(s == \"deleteFirst\"){\n if(!dq.empty()){\n dq.pop_front();\n }\n }\n else{\n if(!dq.empty()){\n dq.pop_back();\n }\n }\n }\n\n for(size_t i = 0; i < dq.size(); i++){\n cout << dq[i];\n if(i + 1 < dq.size()) cout << ' ';\n }\n cout << '\\n';\n}\n\nint main(){\n ios::sync_with_stdio(false); cin.tie(0);\ncout.tie(0);\n\n int T = 1; \n for(int i = 0; i < T; i++){\n solaiman();\n }\n return 0;\n}",
"accuracy": 1,
"time_ms": 150,
"memory_kb": 7132,
"score_of_the_acc": -0.0294,
"final_rank": 1
},
{
"submission_id": "aoj_ALDS1_3_C_11014248",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int n; \n if (!(cin >> n)) return 0;\n list<int> Q;\n\n for (int i = 0; i < n; ++i) {\n string cmd; \n cin >> cmd;\n if (cmd == \"insert\") {\n int x; cin >> x;\n Q.push_front(x);\n } else if (cmd == \"delete\") {\n int x; cin >> x;\n auto it = find(Q.begin(), Q.end(), x);\n if (it != Q.end()) Q.erase(it); // ๆๅใฎ1ๅใ ใๅ้ค\n } else if (cmd == \"deleteFirst\") {\n if (!Q.empty()) Q.pop_front();\n } else if (cmd == \"deleteLast\") {\n if (!Q.empty()) Q.pop_back();\n }\n }\n\n // ๅบๅ๏ผ่ฆ็ด ้ใฎใฟในใใผในใๆซๅฐพใฏๆน่กใฎใฟ\n for (auto it = Q.begin(); it != Q.end(); ) {\n cout << *it;\n if (++it != Q.end()) cout << ' ';\n }\n cout << '\\n';\n return 0;\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 34620,
"score_of_the_acc": -0.7441,
"final_rank": 6
},
{
"submission_id": "aoj_ALDS1_3_C_11010345",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n;\n cin >> n;\n list<int> l;\n\n for (int i = 0; i < n; i++) {\n string cmd;\n cin >> cmd;\n\n if (cmd == \"insert\") \n {\n int x;\n cin >> x;\n l.push_front(x); // ๅ
้ ญใซๆฟๅ
ฅ\n }\n\n else if (cmd == \"delete\") \n {\n int x;\n cin >> x;\n auto it = find(l.begin(), l.end(), x);//ๆค็ดข\n if (it != l.end()) \n {\n l.erase(it);//ๅ้ค\n }\n }\n\n else if (cmd == \"deleteFirst\") \n {\n if (!l.empty()) \n {\n l.pop_front();\n }\n }\n\n else if (cmd == \"deleteLast\") \n {\n if(!l.empty()) \n {\n l.pop_back();\n }\n }\n }\n\n bool first = true;\n for (int x : l) {\n if (!first) cout << \" \";\n cout << x;\n first = false;\n }\n cout << endl;\n\n return 0;\n}\n\n\n// vectorใไฝฟใใชใ็็ฑ\n//vector<int> v = {2, 3, 4};\n//v.insert(v.begin(), 1); // ๅ
้ ญใซ 1 ใ่ฟฝๅ โ ๆขๅญ่ฆ็ด ใๅ
จใฆๅพใใซ็งปๅ",
"accuracy": 1,
"time_ms": 550,
"memory_kb": 34588,
"score_of_the_acc": -1.6215,
"final_rank": 15
},
{
"submission_id": "aoj_ALDS1_3_C_11010312",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n;\n cin >> n;\n list<int> l;\n\n for (int i = 0; i < n; i++) {\n string cmd;\n cin >> cmd;\n if (cmd == \"insert\") {\n int x;\n cin >> x;\n l.push_front(x); // ๅ
้ ญใซๆฟๅ
ฅ\n }\n else if (cmd == \"delete\") {\n int x;\n cin >> x;\n auto it = find(l.begin(), l.end(), x);\n if (it != l.end()) l.erase(it);\n }\n else if (cmd == \"deleteFirst\") {\n if (!l.empty()) l.pop_front();\n }\n else if (cmd == \"deleteLast\") {\n if (!l.empty()) l.pop_back();\n }\n }\n\n bool first = true;\n for (int x : l) {\n if (!first) cout << \" \";\n cout << x;\n first = false;\n }\n cout << \"\\n\";\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 550,
"memory_kb": 34612,
"score_of_the_acc": -1.622,
"final_rank": 16
},
{
"submission_id": "aoj_ALDS1_3_C_10990258",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n int t;\n cin >> t;\n list<int> l;\n while(t--){\n string op;\n cin >> op;\n if (op == \"insert\"){\n int x;\n cin>>x;\n l.push_front(x);\n }else if(op == \"delete\"){\n int x;\n cin >> x;\n auto it = find(l.begin(),l.end(),x);\n if (it != l.end()) l.erase(it);\n }else if (op == \"deleteFirst\"){\n l.pop_front();\n }else if (op == \"deleteLast\"){\n l.pop_back();\n }\n }\n for (auto it = l.begin();it!=l.end();it++){\n if(it != l.begin()) cout<<\" \";\n cout<<*it;\n }\n cout<<'\\n';\n}",
"accuracy": 1,
"time_ms": 190,
"memory_kb": 34404,
"score_of_the_acc": -0.7393,
"final_rank": 5
},
{
"submission_id": "aoj_ALDS1_3_C_10986831",
"code_snippet": "#include <iostream>\n#include <string>\nusing namespace std;\n\nstruct Node {\n unsigned int key;\n Node* next;\n Node* prev;\n};\n\nNode* sentinel;\n\nvoid init(){\n sentinel = new Node();\n sentinel->next = sentinel;\n sentinel->prev = sentinel;\n}\n\nNode* listSearch(unsigned int key){\n Node* current = sentinel->next;\n while (current != sentinel){\n if (current->key == key) return current; // โ ใใใ == ใซไฟฎๆญฃ\n current = current->next;\n }\n return sentinel;\n}\n\nvoid deleteNode(Node* t){\n if (t == sentinel) return;\n t->prev->next = t->next;\n t->next->prev = t->prev;\n delete t;\n}\n\nvoid deleteFirst(){\n Node* t = sentinel->next;\n if (t == sentinel) return;\n deleteNode(t);\n}\n\nvoid deleteLast(){\n Node* t = sentinel->prev;\n if (t == sentinel) return;\n deleteNode(t);\n}\n\nvoid deleteKey(unsigned int key) {\n Node* t = listSearch(key);\n if (t != sentinel) deleteNode(t);\n}\n\nvoid insertFront(unsigned int key) {\n Node* x = new Node();\n x->key = key;\n\n // sentinel ใฎ็ดๅพ๏ผๅ
้ ญ๏ผใซๆฟๅ
ฅ\n x->next = sentinel->next; // (1) x ใฎๅณ้ฃใฏๆงๅ
้ ญ\n x->prev = sentinel; // (2) x ใฎๅทฆ้ฃใฏ sentinel\n sentinel->next->prev = x; // (3) ๆงๅ
้ ญใฎๅทฆ้ฃใ x ใซ\n sentinel->next = x; // (4) sentinel ใฎๅณ้ฃใ x ใซ๏ผ= x ใๆฐๅ
้ ญ๏ผ\n}\n\nvoid printList() {\n Node* cur = sentinel->next;\n bool first = true;\n while (cur != sentinel) {\n if (!first) cout << ' ';\n cout << cur->key;\n first = false;\n cur = cur->next;\n }\n cout << '\\n';\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int n;\n cin >> n;\n init();\n\n for (int i = 0; i < n; ++i) {\n string com;\n cin >> com;\n\n if (com == \"insert\") {\n unsigned int x; cin >> x;\n insertFront(x);\n } \n else if (com == \"delete\") {\n unsigned int x; cin >> x;\n deleteKey(x);\n } \n else if (com == \"deleteFirst\") {\n deleteFirst();\n } \n else if (com == \"deleteLast\") {\n deleteLast();\n }\n }\n\n printList();\n delete sentinel;\n return 0;\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 34644,
"score_of_the_acc": -0.7203,
"final_rank": 4
},
{
"submission_id": "aoj_ALDS1_3_C_10934380",
"code_snippet": "#include <iostream>\n#include <list>\n#include <string>\nusing namespace std;\n\nclass Solution {\npublic:\n int n;\n list<int> lst;\n Solution() {\n cin >> n;\n }\n ~Solution() { }\n\n void solution() {\n for (int i = 0; i < n; ++i) {\n string str;\n int val;\n cin >> str;\n if (str == \"insert\") {\n cin >> val;\n lst.push_front(val);\n } else if (str == \"deleteFirst\") {\n lst.pop_front();\n } else if (str == \"deleteLast\") {\n lst.pop_back();\n } else if (str == \"delete\") {\n cin >> val;\n delete_node(val);\n }\n }\n print();\n }\n void delete_node(int val) {\n for (list<int>::iterator it = lst.begin(); it != lst.end(); ++it) {\n if (*it == val) {\n lst.erase(it);\n break;\n }\n }\n }\n void print() {\n for (auto it = lst.begin(); it != lst.end(); ++it) {\n list<int>::iterator next = it;\n if ((++next) != lst.end()) {\n cout << *it << ' ';\n } else {\n cout << *it << '\\n';\n }\n }\n }\n} ;\nint main() {\n Solution solute;\n solute.solution();\n return 0;\n}",
"accuracy": 1,
"time_ms": 550,
"memory_kb": 34688,
"score_of_the_acc": -1.6237,
"final_rank": 17
},
{
"submission_id": "aoj_ALDS1_3_C_10934379",
"code_snippet": "#include <iostream>\n#include <list>\n#include <string>\nusing namespace std;\n\nclass Solution {\npublic:\n int n;\n list<int> lst;\n Solution() {\n cin >> n;\n }\n ~Solution() { }\n\n void solution() {\n for (int i = 0; i < n; ++i) {\n string str;\n int val;\n cin >> str;\n if (str == \"insert\") {\n cin >> val;\n lst.push_front(val);\n } else if (str == \"deleteFirst\") {\n lst.pop_front();\n } else if (str == \"deleteLast\") {\n lst.pop_back();\n } else if (str == \"delete\") {\n cin >> val;\n delete_node(val);\n }\n }\n print();\n }\n void delete_node(int val) {\n list<int>::iterator it;\n for (it = lst.begin(); it != lst.end(); ++it) {\n if (*it == val) {\n lst.erase(it);\n break;\n }\n }\n }\n void print() {\n for (auto it = lst.begin(); it != lst.end(); ++it) {\n list<int>::iterator next = it;\n if ((++next) != lst.end()) {\n cout << *it << ' ';\n } else {\n cout << *it << '\\n';\n }\n }\n }\n} ;\nint main() {\n Solution solute;\n solute.solution();\n return 0;\n}",
"accuracy": 1,
"time_ms": 550,
"memory_kb": 34572,
"score_of_the_acc": -1.6211,
"final_rank": 14
},
{
"submission_id": "aoj_ALDS1_3_C_10934363",
"code_snippet": "#include <iostream>\nusing namespace std;\n\nclass Solution {\npublic:\n struct Node {\n int value;\n Node *prev, *next;\n Node() {}\n Node(int V) : value(V), prev(nullptr), next(nullptr) {}\n Node(int V, Node *P, Node *N) : value(V), prev(P), next(N) {}\n } ;\n int n;\n Node *head, *tail;\n Solution() {\n cin >> n;\n head = nullptr, tail = nullptr;\n }\n ~Solution() { }\n\n void solution() {\n for (int i = 0; i < n; ++i) {\n string str;\n int val;\n cin >> str;\n if (str == \"insert\") {\n cin >> val;\n insert(val);\n } else if (str == \"deleteFirst\") {\n delete_first();\n } else if (str == \"deleteLast\") {\n delete_last();\n } else if (str == \"delete\") {\n cin >> val;\n delete_node(val);\n }\n }\n print();\n }\n void insert(int val) {\n Node *node = new Node(val, nullptr, head);\n if (head == nullptr) {\n head = node;\n tail = node;\n } else {\n head = node;\n head->next->prev = head;\n }\n }\n void delete_node(int val) {\n Node *node(head);\n while (node != nullptr && node->value != val) {\n node = node->next;\n }\n if (node == nullptr) {\n return;\n }\n if (node == head) {\n delete_first();\n } else if (node == tail) {\n delete_last();\n } else {\n node->prev->next = node->next;\n node->next->prev = node->prev;\n delete node;\n }\n }\n void delete_first() {\n Node *node = head;\n head = node->next;\n if (head != nullptr) {\n head->prev = nullptr;\n } else {\n tail = nullptr;\n }\n delete node;\n }\n void delete_last() {\n Node *node = tail;\n tail = node->prev;\n if (tail != nullptr) {\n tail->next = nullptr;\n } else {\n head = nullptr;\n }\n delete node;\n }\n void print() {\n Node *node = head;\n while (node->next != nullptr) {\n cout << node->value << ' ';\n node = node->next;\n }\n cout << node->value << '\\n';\n }\n} ;\nint main() {\n Solution solute;\n solute.solution();\n return 0;\n}",
"accuracy": 1,
"time_ms": 550,
"memory_kb": 34452,
"score_of_the_acc": -1.6184,
"final_rank": 13
},
{
"submission_id": "aoj_ALDS1_3_C_10922605",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define rep2(i, s, n) for (ll i = (ll)(s); i < (ll)(n); i++)\n\n\n// vectorใๅบๅใใ\nvoid vec1print(vector<ll> vec) {\n rep(i, vec.size()) {\n cout << vec[i] << endl;\n }\n}\nvoid vec2print(vector<ll> vec) {\n rep(i, vec.size()) {\n cout << vec[i] << \" \";\n }\n cout << endl;\n}\n\n// ๆๅคงใๆๅฐใๆฑใใ\nint minval(vector<ll> vec) {\n return *min_element(begin(vec), end(vec));\n}\nint maxval(vector<ll> vec) {\n return *max_element(begin(vec), end(vec));\n}\n\n// ใฐใชใใ็จ\nvector<ll> dx = {1, 0, -1, 0};\nvector<ll> dy = {0, 1, 0, -1};\nbool in_grid(ll x, ll y, ll limit_x, ll limit_y) {\n return 0 <= x and x < limit_x and 0 <= y and y < limit_y;\n}\nstruct linked_list {\n ll prev;\n ll next;\n ll key;\n};\n\nlinked_list l[2000000];\nll head = -1;\nll tail = -1;\nll unused = 0;\n\nvoid insert(ll x) {\n if (head == -1) {\n l[0].key = x;\n l[0].prev = -1;\n l[0].next = -1;\n head = 0;\n tail = 0;\n unused = 1;\n }\n else {\n l[unused].key = x;\n l[unused].prev = -1;\n l[unused].next = head;\n l[head].prev = unused;\n head = unused;\n unused++;\n }\n}\n\nvoid delete_node(ll x) {\n ll target = head;\n while (target != -1) {\n if (l[target].key == x) {\n ll prev = l[target].prev;\n ll next = l[target].next;\n\n if (prev != -1) {\n l[prev].next = next;\n }\n else {\n head = next;\n }\n if (next != -1) {\n l[next].prev = prev;\n }\n else {\n tail = prev;\n }\n break;\n }\n target = l[target].next;\n }\n}\n\nvoid deleteFirst() {\n if (head == -1) return;\n ll next = l[head].next;\n if (next != -1) {\n l[next].prev = -1;\n }\n else {\n tail = -1;\n }\n head = next;\n}\n\nvoid deleteLast() {\n if (tail == -1) return;\n ll prev = l[tail].prev;\n if (prev != -1) {\n l[prev].next = -1;\n }\n else {\n head = -1;\n }\n tail = prev;\n}\n\nvoid print_list() {\n if (head == -1) return;\n ll target = head;\n while (target != -1) {\n cout << l[target].key;\n target = l[target].next;\n if (target != -1) cout << \" \";\n }\n cout << endl;\n}\n\n\n// main\nvoid solve() {\n ll n;\n cin >> n;\n rep(i,n) {\n string s;\n ll x;\n cin >> s;\n if (s == \"insert\") {\n cin >> x;\n insert(x);\n }\n else if (s == \"delete\") {\n cin >> x;\n delete_node(x);\n }\n else if (s == \"deleteFirst\") {\n deleteFirst();\n }\n else if (s == \"deleteLast\") {\n deleteLast();\n }\n }\n print_list();\n\n return;\n}\n\nint main() {\n solve();\n return 0;\n}",
"accuracy": 1,
"time_ms": 380,
"memory_kb": 30140,
"score_of_the_acc": -1.107,
"final_rank": 8
},
{
"submission_id": "aoj_ALDS1_3_C_10920197",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);\nlong long ar[200005];\nint main()\n{\n optimize();\n long long n,m,i;\n cin>>n;\n list<long long>li;\n while(n--)\n {\n string s;\n cin>>s;\n if(s==\"insert\")\n {\n cin>>m;\n li.push_front(m);\n }\n else if(s==\"delete\")\n {\n cin>>m;\n auto it=find(li.begin(),li.end(),m);\n if(it != li.end())\n {\n li.erase(it);\n }\n }\n else if(s==\"deleteFirst\")\n {\n li.pop_front();\n }\n else if (s==\"deleteLast\")\n {\n li.pop_back();\n }\n }\n for(auto it=li.begin(); it!=li.end();it++)\n {\n if(it!=li.begin())\n {\n cout<<\" \";\n }\n cout<<*it;\n }\n cout<<\"\\n\";\n return 0;\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 34412,
"score_of_the_acc": -0.7151,
"final_rank": 3
},
{
"submission_id": "aoj_ALDS1_3_C_10918318",
"code_snippet": "# include <iostream>\n# include <list>\nusing namespace std;\n\nint main() {\n \n list<int> lst;\n\n int n; cin >> n;\n while (n--) {\n string cmd; cin >> cmd;\n if (cmd == \"insert\") { //ๅคด้จๆๅ
ฅ่็น\n int x; cin >> x;\n lst.insert(lst.begin(), x);\n }\n else if (cmd == \"delete\") { //ๅ ้ค็ฌฌไธไธชๅผไธบx็่็น\n int x; cin >> x;\n //้ๅlist,listไธๆฏๆ้ๆบ่ฎฟ้ฎๅฟ
้กป็จ่ฟญไปฃๅจ้ๅ\n for (auto it = lst.begin(); it != lst.end(); it++)\n {\n if (*it == x) {\n //่ฟญไปฃๅจๅ ้ค\n //ไธ่ฝ็จๅผๅ ้ค๏ผไผๅ ้คๆๆval==x็่็น\n lst.erase(it);\n break;\n }\n }\n }\n else if (cmd == \"deleteFirst\") { //ๅ ้คๅคด้จๅ
็ด \n lst.pop_front();\n }\n else { //ๅ ้คๅฐพ้จๅ
็ด \n lst.pop_back();\n }\n }\n\n for (auto it = lst.begin(); it != lst.end(); it++)\n {\n if (it != lst.begin()) cout << \" \";\n cout << *it;\n }\n cout << endl;\n}",
"accuracy": 1,
"time_ms": 550,
"memory_kb": 34288,
"score_of_the_acc": -1.6147,
"final_rank": 12
},
{
"submission_id": "aoj_ALDS1_3_C_10903986",
"code_snippet": "using namespace std;\n#include <iostream>\n#include <string>\n#include <vector>\nstruct TNode\n{\n TNode *Next;\n TNode *Previous;\n int Element;\n};\nclass TList\n{\nprivate:\n TNode *Top = nullptr;\n TNode *Last = nullptr;\n\npublic:\n void Insert(int &Element)\n {\n TNode *NewNodeptr = new TNode{Top, nullptr, Element};\n if (Top == nullptr && Last == nullptr)\n { /// ๅๆ็ถๆ
ใฎๅฆ็ใ่จ่ฟฐ\n Last = NewNodeptr;\n }\n else\n {\n Top->Previous = NewNodeptr;\n }\n Top = NewNodeptr;\n }\n void DeleteOperation(TNode *Target)\n {\n if (Target == nullptr)\n {\n return;\n }\n if (Target == Top)\n {\n Top = Top->Next;\n }\n else\n {\n Target->Previous->Next = Target->Next;\n }\n if (Target == Last)\n {\n Last = Last->Previous;\n }\n else\n {\n Target->Next->Previous = Target->Previous;\n }\n delete Target;\n return;\n }\n TNode *Find(int Element)\n {\n for (TNode *Current = Top; Current != nullptr; Current = Current->Next)\n {\n if (Current->Element == Element)\n {\n return Current;\n }\n }\n return nullptr;\n }\n void Delete(int &Element)\n {\n DeleteOperation(Find(Element));\n }\n void DeleteFirst()\n {\n DeleteOperation(Top);\n }\n void DeleteLast()\n {\n DeleteOperation(Last);\n }\n void ShowAllElements()\n {\n if (Top == nullptr || Last == nullptr)\n {\n return;\n }\n while (Top->Next != nullptr)\n {\n cout << Top->Element << \" \";\n Top = Top->Next;\n }\n cout << Top->Element << \"\\n\";\n }\n}\n;\n\nint main()\n{\n int N;\n cin >> N;\n TList list;\n for (int index = 0; index < N; index++)\n {\n string Command;\n cin >> Command;\n if (Command == \"insert\")\n {\n int Element;\n cin >> Element;\n list.Insert(Element);\n }\n else if (Command == \"delete\")\n {\n int Element;\n cin >> Element;\n list.Delete(Element);\n }\n else if (Command == \"deleteFirst\")\n {\n list.DeleteFirst();\n }\n else\n {\n list.DeleteLast();\n }\n }\n list.ShowAllElements();\n}",
"accuracy": 1,
"time_ms": 410,
"memory_kb": 34816,
"score_of_the_acc": -1.2851,
"final_rank": 10
},
{
"submission_id": "aoj_ALDS1_3_C_10899432",
"code_snippet": "#include <bits/stdc++.h>\n\n\ntemplate <typename T>\nclass Node{\n public:\n T value_;\n Node<T>* prev_;\n Node<T>* next_;\n\n Node(T v, Node<T>* prev, Node<T>* next): value_(v), prev_(prev), next_(next){} \n};\n\ntemplate <typename T>\nclass List{\n Node<T> lSentinel = Node<T>(T(),nullptr, nullptr);\n Node<T> rSentinel = Node<T>(T(),nullptr, nullptr);\n\n public:\n List(){\n lSentinel.next_ = &rSentinel;\n rSentinel.prev_ = &lSentinel;\n }\n \n void push_front(T value){\n Node<T>* newNode = new Node<T>(value, &lSentinel, lSentinel.next_);\n\n lSentinel.next_->prev_ = newNode;\n lSentinel.next_ = newNode;\n }\n\n void push_back(T value){\n Node<T>* newNode = new Node<T>(value, rSentinel.prev_, &rSentinel);\n\n rSentinel.prev_->next_ =newNode;\n rSentinel.prev_ = newNode;\n }\n\n void delete_node(T v){\n Node<T>* node = lSentinel.next_;\n while(node != &rSentinel){\n if(node->value_ == v){\n node->prev_->next_ = node->next_;\n node->next_->prev_ = node->prev_;\n delete node;\n break;\n }\n node = node->next_;\n }\n }\n\n void pop_front(){\n if(lSentinel.next_ == &rSentinel) return;\n\n Node<T>* target = lSentinel.next_;\n lSentinel.next_ = target->next_;\n target->next_->prev_ = &lSentinel;\n delete target;\n }\n\n void pop_back(){\n if(rSentinel.prev_ == &lSentinel) return;\n\n Node<T>* target = rSentinel.prev_;\n rSentinel.prev_ = target->prev_;\n target->prev_->next_ = &rSentinel;\n delete target;\n }\n\n class Itarator{\n Node<T>* node_;\n public:\n Itarator(Node<T>* node):node_(node){}\n T& operator*(){return node_->value_;}\n Itarator& operator++(){node_ = node_->next_; return *this;}\n bool operator!=(const Itarator& other)const {return node_ != other.node_;}\n };\n\n Itarator begin(){return Itarator(lSentinel.next_);}\n Itarator end(){return Itarator(&rSentinel);}\n};\n\nint main(){\n int n;\n std::cin >> n;\n List<long long> list;\n for (int i = 0; i < n; i++){\n std::string c; std::cin >> c;\n if(c ==\"insert\"){\n int x; std::cin >> x;\n list.push_front(x);\n }else if(c == \"delete\"){\n int x; std::cin >> x;\n list.delete_node(x);\n }else if(c == \"deleteFirst\"){\n list.pop_front();\n }else if(c == \"deleteLast\"){\n list.pop_back();\n }\n }\n std::string ans;\n for(auto value: list){\n ans += std::to_string(value) + \" \";\n }\n ans.pop_back();\n std::cout << ans << std::endl;\n}",
"accuracy": 1,
"time_ms": 550,
"memory_kb": 34724,
"score_of_the_acc": -1.6245,
"final_rank": 18
},
{
"submission_id": "aoj_ALDS1_3_C_10898226",
"code_snippet": "#include <cstdio>\n\nstruct Node {\n int key;\n Node *next;\n Node *prev;\n};\n\nNode* nil = nullptr;\n\nNode* listSearch(int key) {\n Node* cur = nil->next;\n while (cur != nil && cur->key != key) {\n cur = cur->next;\n }\n return cur;\n}\n\nvoid init() {\n nil = new Node();\n nil->next = nil;\n nil->prev = nil;\n}\n\nvoid printList() {\n Node* cur = nil->next;\n bool first = true;\n while (cur != nil) {\n if (!first) printf(\" \");\n printf(\"%d\", cur->key);\n first = false;\n cur = cur->next;\n }\n printf(\"\\n\");\n}\n\nvoid deleteNode(Node* t) {\n if (t == nil) return;\n t->prev->next = t->next;\n t->next->prev = t->prev;\n delete t;\n}\n\nvoid deleteFirst() {\n deleteNode(nil->next);\n}\n\nvoid deleteLast() {\n deleteNode(nil->prev);\n}\n\nvoid deleteKey(int key) {\n deleteNode(listSearch(key));\n}\n\nvoid insert(int key) {\n Node* x = new Node();\n x->key = key;\n x->next = nil->next;\n nil->next->prev = x;\n nil->next = x;\n x->prev = nil;\n}\n\nint main() {\n int n;\n scanf(\"%d\", &n);\n\n init();\n\n for (int i = 0; i < n; i++) {\n char com[20];\n int key;\n scanf(\"%s\", com);\n\n if (com[0] == 'i') {\n scanf(\"%d\", &key);\n insert(key);\n } else if (com[0] == 'd') {\n if (com[6] == 'F') {\n deleteFirst();\n } else if (com[6] == 'L') {\n deleteLast();\n } else {\n scanf(\"%d\", &key);\n deleteKey(key);\n }\n }\n }\n\n printList();\n\n // ๆๅพใซ็ชๅ
ตใ่งฃๆพ\n delete nil;\n\n return 0;\n}",
"accuracy": 1,
"time_ms": 180,
"memory_kb": 34032,
"score_of_the_acc": -0.7065,
"final_rank": 2
},
{
"submission_id": "aoj_ALDS1_3_C_10897583",
"code_snippet": "#include <bits/stdc++.h>\n#include <cstddef>\nusing namespace std;\n\nconst int CAPACITY = 2000000;\n\ntemplate <typename T> struct DataLink {\n T data;\n DataLink *pre;\n DataLink *next;\n\n DataLink() : data{}, pre{nullptr}, next{nullptr} {}\n DataLink(T i, DataLink *pre, DataLink *next)\n : data{i}, pre{pre}, next{next} {}\n};\n\ntemplate <typename T> struct LinkedList {\n array<DataLink<T>, CAPACITY> link_stack;\n int stack_tail = 0;\n DataLink<T> *first = nullptr;\n DataLink<T> *last = nullptr;\n int count = 0;\n\n void scan_pre(DataLink<T> *&d) { d = d->pre; }\n void scan_next(DataLink<T> *&d) { d = d->next; }\n\n bool is_empty() { return count == 0; }\n\n void insert(const T &data) {\n link_stack[stack_tail] = (DataLink<T>(data, nullptr, first));\n DataLink<T> *new_data = &link_stack[stack_tail];\n stack_tail++;\n\n if (is_empty()) {\n last = new_data;\n } else {\n first->pre = new_data;\n }\n first = new_data;\n count++;\n }\n\n void del_first() {\n if (count == 1) {\n first = nullptr;\n last = nullptr;\n } else {\n first->next->pre = nullptr;\n first = first->next;\n }\n count--;\n }\n void del_last() {\n if (count == 1) {\n first = nullptr;\n last = nullptr;\n } else {\n last->pre->next = nullptr;\n last = last->pre;\n }\n count--;\n }\n void del(const T &del_data) {\n DataLink<T> *seek = first;\n while (seek->data != del_data) {\n scan_next(seek);\n if (seek == nullptr) {\n return;\n }\n }\n\n if (seek == first) {\n del_first();\n } else if (seek == last) {\n del_last();\n } else {\n seek->pre->next = seek->next;\n seek->next->pre = seek->pre;\n count--;\n }\n }\n};\n\nint main() {\n int n;\n cin >> n;\n LinkedList<int> l;\n for (int i = 0; i < n; i++) {\n char buf[15];\n int key;\n scanf(\"%s\", buf);\n string command = buf;\n if (command == \"insert\") {\n cin >> key;\n l.insert(key);\n } else if (command == \"delete\") {\n cin >> key;\n l.del(key);\n } else if (command == \"deleteFirst\")\n l.del_first();\n else if (command == \"deleteLast\")\n l.del_last();\n }\n\n DataLink<int> *seek = l.first;\n for (int i = 0; i < l.count; i++) {\n if (i == l.count - 1)\n cout << seek->data << endl;\n else\n cout << seek->data << \" \";\n\n if (seek->next != nullptr)\n l.scan_next(seek);\n }\n}",
"accuracy": 1,
"time_ms": 300,
"memory_kb": 50360,
"score_of_the_acc": -1.3659,
"final_rank": 11
},
{
"submission_id": "aoj_ALDS1_3_C_10897582",
"code_snippet": "#include <bits/stdc++.h>\n#include <cstddef>\nusing namespace std;\n\nconst int CAPACITY = 100000;\n\ntemplate <typename T> struct DataLink {\n T data;\n DataLink *pre;\n DataLink *next;\n\n DataLink() : data{}, pre{nullptr}, next{nullptr} {}\n DataLink(T i, DataLink *pre, DataLink *next)\n : data{i}, pre{pre}, next{next} {}\n};\n\ntemplate <typename T> struct LinkedList {\n array<DataLink<T>, CAPACITY> link_stack;\n int stack_tail = 0;\n DataLink<T> *first = nullptr;\n DataLink<T> *last = nullptr;\n int count = 0;\n\n void scan_pre(DataLink<T> *&d) { d = d->pre; }\n void scan_next(DataLink<T> *&d) { d = d->next; }\n\n bool is_empty() { return count == 0; }\n\n void insert(const T &data) {\n link_stack[stack_tail] = (DataLink<T>(data, nullptr, first));\n DataLink<T> *new_data = &link_stack[stack_tail];\n stack_tail++;\n\n if (is_empty()) {\n last = new_data;\n } else {\n first->pre = new_data;\n }\n first = new_data;\n count++;\n }\n\n void del_first() {\n if (count == 1) {\n first = nullptr;\n last = nullptr;\n } else {\n first->next->pre = nullptr;\n first = first->next;\n }\n count--;\n }\n void del_last() {\n if (count == 1) {\n first = nullptr;\n last = nullptr;\n } else {\n last->pre->next = nullptr;\n last = last->pre;\n }\n count--;\n }\n void del(const T &del_data) {\n DataLink<T> *seek = first;\n while (seek->data != del_data) {\n scan_next(seek);\n if (seek == nullptr) {\n return;\n }\n }\n\n if (seek == first) {\n del_first();\n } else if (seek == last) {\n del_last();\n } else {\n seek->pre->next = seek->next;\n seek->next->pre = seek->pre;\n count--;\n }\n }\n};\n\nint main() {\n int n;\n cin >> n;\n LinkedList<int> l;\n for (int i = 0; i < n; i++) {\n char buf[15];\n int key;\n scanf(\"%s\", buf);\n string command = buf;\n if (command == \"insert\") {\n cin >> key;\n l.insert(key);\n } else if (command == \"delete\") {\n cin >> key;\n l.del(key);\n } else if (command == \"deleteFirst\")\n l.del_first();\n else if (command == \"deleteLast\")\n l.del_last();\n }\n\n DataLink<int> *seek = l.first;\n for (int i = 0; i < l.count; i++) {\n if (i == l.count - 1)\n cout << seek->data << endl;\n else\n cout << seek->data << \" \";\n\n if (seek->next != nullptr)\n l.scan_next(seek);\n }\n}",
"accuracy": 0.9,
"time_ms": 230,
"memory_kb": 5824,
"score_of_the_acc": -0.1951,
"final_rank": 20
},
{
"submission_id": "aoj_ALDS1_3_C_10894193",
"code_snippet": "using namespace std;\n#include <iostream>\n#include <string>\n#include <vector>\nstruct TNode\n{\n TNode *Next;\n TNode *Previous;\n int Element;\n};\nclass TList\n{\nprivate:\n TNode *Top = nullptr;\n TNode *Last = nullptr;\n\npublic:\n void Insert(int &Element)\n {\n TNode *NewNodeptr = new TNode{Top, nullptr, Element};\n if (Top == nullptr && Last == nullptr)\n { /// ๅๆ็ถๆ
ใฎๅฆ็ใ่จ่ฟฐ\n Last = NewNodeptr;\n }\n else\n {\n Top->Previous = NewNodeptr;\n }\n Top = NewNodeptr;\n }\n void DeleteOperation(TNode *Target)\n {\n if (Target == nullptr)\n {\n return;\n }\n else\n {\n if (Target == Top)\n {\n Top = Top->Next;\n }\n else\n {\n Target->Previous->Next = Target->Next;\n }\n if (Target == Last)\n {\n Last = Last->Previous;\n }\n else\n {\n Target->Next->Previous = Target->Previous;\n }\n delete Target;\n return;\n }\n }\n TNode *Find(int Element)\n {\n for (TNode *Current = Top; Current != nullptr; Current = Current->Next)\n {\n if (Current->Element == Element)\n {\n return Current;\n }\n }\n return nullptr;\n }\n void Delete(int &Element)\n {\n DeleteOperation(Find(Element));\n }\n void DeleteFirst()\n {\n DeleteOperation(Top);\n }\n void DeleteLast()\n {\n DeleteOperation(Last);\n }\n void ShowAllElements()\n {\n if (Top != nullptr && Last != nullptr)\n {\n while (Top->Next != nullptr)\n {\n cout << Top->Element << \" \";\n Top = Top->Next;\n }\n cout << Top->Element << \"\\n\";\n }\n }\n};\n\nint main()\n{\n int N;\n cin >> N;\n TList list;\n for (int index = 0; index < N; index++)\n {\n string Command;\n cin >> Command;\n if (Command == \"insert\")\n {\n int Element;\n cin >> Element;\n list.Insert(Element);\n }\n else if (Command == \"delete\")\n {\n int Element;\n cin >> Element;\n list.Delete(Element);\n }\n else if (Command == \"deleteFirst\")\n {\n list.DeleteFirst();\n }\n else\n {\n list.DeleteLast();\n }\n }\n list.ShowAllElements();\n}",
"accuracy": 1,
"time_ms": 410,
"memory_kb": 34688,
"score_of_the_acc": -1.2823,
"final_rank": 9
},
{
"submission_id": "aoj_ALDS1_3_C_10891197",
"code_snippet": "#include <bits/stdc++.h>\n\n\nint main(){\n int N;\n std::cin >> N;\n std::list<int> A;\n for (int i = 0; i < N; i++){\n std::string cmd;\n std::cin >> cmd;\n if(cmd == \"insert\"){\n int v; std::cin >> v;\n A.push_front(v);\n }else if(cmd == \"delete\"){\n int v; std::cin >> v;\n auto it = std::find(A.begin(), A.end(), v);\n if(it != A.end()) A.erase(it);\n }else if( cmd == \"deleteFirst\"){\n A.pop_front();\n }else if( cmd == \"deleteLast\"){\n A.pop_back();\n }\n }\n\n std::string ans = \"\";\n for(auto v: A){\n ans += std::to_string(v) + \" \";\n } \n ans.pop_back();\n std::cout << ans << std::endl;\n}",
"accuracy": 1,
"time_ms": 560,
"memory_kb": 34416,
"score_of_the_acc": -1.642,
"final_rank": 19
}
] |
aoj_ALDS1_4_D_cpp
| "Allocation\nYou are given $n$ packages of $w_i$ kg from a belt conveyor in order ($i = 0, 1, ... n-(...TRUNCATED)
| [{"submission_id":"aoj_ALDS1_4_D_10995248","code_snippet":"#include<iostream>\n#include<vector>\n#in(...TRUNCATED)
|
aoj_ALDS1_3_B_cpp
| "There are\nn\nprocesses in a queue. Each process has name\ni\nand time\ni\n. The round-robin sched(...TRUNCATED)
| [{"submission_id":"aoj_ALDS1_3_B_11064149","code_snippet":"#include <bits/stdc++.h>\nusing namespace(...TRUNCATED)
|
aoj_ALDS1_5_A_cpp
| "Exhaustive Search\nWrite a program which reads a sequence\nA\nof\nn\nelements and an integer\nM\n, (...TRUNCATED)
| [{"submission_id":"aoj_ALDS1_5_A_11061393","code_snippet":"# include <stdio.h>\n\nstatic int N, A[50(...TRUNCATED)
|
End of preview. Expand
in Data Studio
AOJ-CodeRank-Benchmark: Hybrid Efficiency Ranking Benchmark Dataset
1. Overview
This dataset (AOJ-CodeRank-Benchmark) was created to evaluate the capability of Large Language Models (LLMs) in code efficiency ranking tasks using a high-quality, structured benchmark.
The dataset is built entirely on code submission records from Aizu Online Judge (AOJ), strictly adhering to the principle of correctness first, efficiency second.
- Problem Scope: ALDS1 (Fundamental Algorithms), DSL/GRL/CGL (Advanced Data Structures/Graphs), and Volume 0000-3299 (Classic Contest Problems).
- Core Feature: Eliminates 0ms submissions and low-quality/non-unique submissions, ensuring true time differentiation across all data groups.
2. Data Structure
The dataset uses the JSON Lines (.jsonl) format. Each line represents a single Task Group object.
Structure Preview (Candidates):
| Field Name | Type | Description |
|---|---|---|
submission_id |
string | Unique Submission ID. |
code_snippet |
string | The complete C++ source code. |
accuracy |
float | Accuracy Score (0.0 to 1.0). |
time_ms |
integer | Actual Execution Time (in milliseconds). |
score_of_the_acc |
float | Normalized Efficiency Score (Range -2.0 to 0.0). |
final_rank |
integer | Final Competition Rank (1, 2, 3...). |
3. Ground Truth (GT) Scoring and Ranking Logic ๐
The LLM's objective is to predict the final_rank. This ranking is derived from a unique two-tiered system:
Phase I: Efficiency Score (score_of_the_acc)
This score is a purely performance-based metric, calculating the normalized inverse sum of Time and Memory costs within the task group.
(Note: Score is between -2.0 and 0.0. A score closer to 0.0 is better.)
Phase II: Final Ranking (final_rank) Mechanism
The final rank is determined by a lexicographical sort (Standard Competition Ranking) using the following priority:
- Primary Sort Key (Accuracy):
accuracy(Descending). - Secondary Sort Key (Efficiency):
score_of_the_acc(Descending).
Tie-Breaking: Submissions with identical Accuracy and Efficiency Score receive the same rank (1-2-2-4 rule).
4. Usage Example
from datasets import load_dataset
# Load the dataset and access the candidates list
dataset = load_dataset("Slime/AOJ-CodeRank-Benchmark", data_files="train.jsonl", split="train")
# The LLM sorting algorithm will receive task['candidates'] for ranking
for task in dataset:
candidates = task['candidates']
# Algorithm generates predicted_rank for candidates
# Evaluation compares predicted_rank against ground_truth['final_rank']
5. Acknowledgments
Original submission records and problem context are sourced from Aizu Online Judge (AOJ).
- Downloads last month
- 28