# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
894626 | fanwen | Topical (NOI23_topical) | C++17 | 405 ms | 138156 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>
using namespace std;
#define fi first
#define se second
#define ll long long
#define file(name) \
if(fopen(name".inp", "r")) \
freopen(name".inp", "r", stdin), freopen(name".out", "w", stdout);
void you_make_it(void) {
int n, m; cin >> n >> m;
vector <vector <int>> a(n, vector <int> (m));
vector <vector <int>> s(n, vector <int> (m));
vector <int> cnt(n);
vector <vector <pair <int, int>>> val(m);
vector <long long> p(m);
queue <int> q;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> a[i][j];
if(a[i][j] == 0) cnt[i]++;
val[j].emplace_back(a[i][j], i);
}
if(cnt[i] == m) q.push(i);
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> s[i][j];
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... |