# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
893316 | vjudge1 | Topical (NOI23_topical) | C++17 | 448 ms | 149696 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 TASKNAME "codeforce"
#define pb push_back
#define pli pair<int,int>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxn=1e6+10;
const ll inf=1e18;
const ll mod=1e9+7;
ll n,k,s[maxn],id[maxn],cnt[maxn];
bool r[maxn];
vector<vector<pli>>c;
vector<vector<ll>>u;
void solve()
{
cin >> n >> k;
c.resize(k+2,vector<pli>(n+2));
u.resize(k+2,vector<ll>(n+2));
for(int j=1;j<=n;j++)
{
for(int i=1;i<=k;i++)
{
cin >> c[i][j].fi;
c[i][j].se=j;
}
}
for(int i=1;i<=n;i++)
# | 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... |