Submission #503921

#	Time	Username	Problem	Language	Result	Execution time	Memory
503921		Koosha_mv	Swap Swap Sort (CCO21_day1problem1)	C++14	0 / 25	983 ms	4172 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<(x.F)<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first

const int N=1000;

int dist[N][N];

int main(){
	f(i,0,N){
		f(j,0,N){
			dist[i][j]=rand();
		}
	}
	f(i,0,N){
		f(j,0,N){
			f(k,0,N){
				minm(dist[i][k],dist[i][j]+dist[j][k]);
			}
		}
	}
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 3
• Subtask 3: 0 / 5
• Subtask 4: 0 / 14