Submission #408416

#	Time	Username	Problem	Language	Result	Execution time	Memory
408416		Carmel_Ab1	Swapping Cities (APIO20_swap)	C++17	0 / 100	134 ms	8792 KiB

swap

#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

vvi dp,g;
umap<int,umap<int,int>>c;

int go(int i,int j){
    if(dp[i][j]!=1e9)return dp[i][j];
    if(g[i].size()==1 && g[j].size()==1 && g[i][0]==j)
        return 1e9;
    
}
void init(int N, int M,vi U, vi V, vi W) {
    return;
    g.resize(N);
    for(int i=0; i<M;i++){
        g[U[i]].pb(V[i]);
        g[V[i]].pb(U[i]);
        c[U[i]][V[i]]=c[V[i]][U[i]]=W[i];
    }
    dp.resize(N,vi(N,1e9));

}

int getMinimumFuelCapacity(int x, int y) {
    return -1;
}

Compilation message (stderr)

swap.cpp: In function 'int go(int, int)':
swap.cpp:40:1: warning: control reaches end of non-void function [-Wreturn-type]
   40 | }
      | ^

• Subtask 1: 0 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 17
• Subtask 4: 0 / 20
• Subtask 5: 0 / 23
• Subtask 6: 0 / 27