# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1114341 | SalihSahin | Netrpeljivost (COI23_netrpeljivost) | C++14 | 443 ms | 107112 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 int long long
int dp[1<<11][(1<<11)+1];
int d[(1<<11)+1][(1<<11)+1];
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
for(int i=0; i<=n; i++){
for(int j=0; j<n; j++){
dp[j][i]=1e18;
}
dp[0][i]=0;
}
for(int i=0; i<n; i++){
for(int l=0; l<n; l++)
cin >> d[i][l];
}
for(int i=1; i<n; i++){
int c=0, val=i;
int f=0;
# | 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... |