# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
286540 | gs18115 | Travelling Salesperson (CCO20_day2problem1) | C++14 | 1 ms | 384 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<iostream>
#include<vector>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18;
int tp[2010][2010];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin>>n;
for(int i=1;i++<n;)
{
string s;
cin>>s;
for(int j=1;j<i;j++)
tp[i][j]=tp[j][i]=s[j-1]=='B'?0:1;
}
for(int i=0;i++<n;)
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |