# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
733033 | LittleCube | Council (JOI23_council) | C++14 | 3074 ms | 85996 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define pii pair<int, int>
#define F first
#define S second
using namespace std;
int N, M, sum[20], ans[300005];
vector<pii> dp[1 << 20];
bitset<20> b[300005];
void simplify(vector<pii> &v)
{
sort(v.begin(), v.end(), greater<pii>());
v.resize(unique(v.begin(), v.end(), [&](pii p1, pii p2)
{ return p1.S == p2.S; }) - v.begin());
if (v.size() >= 2)
v.resize(2);
}
signed main()
{
cin >> N >> M;
for (int i = 1; i <= N; i++)
{
for (int j = 0; j < M; j++)
{
int a;
cin >> a;
b[i][j] = a;
sum[j] += a;
Compilation message (stderr)
# | 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... |