# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1176675 | MongHwa | Council (JOI23_council) | C++20 | 2565 ms | 2532 KiB |
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#include <iostream>
using namespace std;
int vote[300005][25];
int cnt[25];
int arr[300005], val[1<<20], calc[1<<20];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
if(n <= 3000)
{
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
{
cin >> vote[i][j];
cnt[j] += vote[i][j];
}
for(int i = 0; i < n; i++)
{
int ans = 0;
for(int j = 0; j < m; j++)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |