# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
123921 | gs14004 | Naan (JOI19_naan) | C++17 | 645 ms | 82616 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;
const int MAXN = 2005;
using lint = long long;
using pi = pair<lint, lint>;
int n, m;
int a[MAXN][MAXN];
vector<pi> frac;
vector<int> who;
pi howLeft[MAXN][MAXN];
bool vis[MAXN];
auto cmp = [](pi a, pi b){
return (__int128)a.first * b.second < (__int128) b.first * a.second;
};
int main(){
scanf("%d %d",&n,&m);
for(int i=1; i<=n; i++){
for(int j=1; j<=m; j++){
scanf("%d",&a[i][j]);
}
}
for(int i=1; i<=n; i++){
lint sum = 0;
for(int j=1; j<=m; j++){
sum += a[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... |