Submission #203077

#TimeUsernameProblemLanguageResultExecution timeMemory
203077cheetoseCoin Collecting (JOI19_ho_t4)C++11
0 / 100
27 ms31868 KiB
#include<cstdio> #include<cstdlib> #include<iostream> #include<vector> #include<queue> #include<bitset> #include<string> #include<stack> #include<set> #include<unordered_set> #include<map> #include<unordered_map> #include<cstring> #include<complex> #include<cmath> #include<iomanip> #include<numeric> #include<algorithm> #include<list> #include<functional> #include<cassert> #define mp make_pair #define pb push_back #define X first #define Y second #define y0 y12 #define y1 y22 #define INF 987654321987654321 #define PI 3.141592653589793238462643383279502884 #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c)) #define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c)) #define MEM0(a) memset((a),0,sizeof(a)); #define MEM_1(a) memset((a),-1,sizeof(a)); #define ALL(a) a.begin(),a.end() #define SYNC ios_base::sync_with_stdio(false);cin.tie(0) using namespace std; typedef long long ll; typedef long double ld; typedef double db; typedef unsigned int uint; typedef unsigned long long ull; typedef pair<int, int> Pi; typedef pair<ll, ll> Pll; typedef pair<ld, ld> Pd; typedef vector<int> Vi; typedef vector<ll> Vll; typedef vector<double> Vd; typedef vector<Pi> VPi; typedef vector<Pll> VPll; typedef vector<Pd> VPd; typedef tuple<int, int, int> iii; typedef tuple<int, int, int, int> iiii; typedef tuple<ll, ll, ll> LLL; typedef vector<iii> Viii; typedef vector<LLL> VLLL; typedef complex<double> base; const int MOD = 1000000007; ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; } ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; } ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); } int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 }; Pll p[200005]; ll d[2005][2005],cost[2005][2005]; ll res(int i, int j, int x) { return min(abs(p[i].X - x) + abs(p[i].Y - 1) + abs(p[j].X - x) + abs(p[j].Y - 2), abs(p[i].X - x) + abs(p[i].Y - 2) + abs(p[j].X - x) + abs(p[j].Y - 1)); } int n; ll go(int L, int R) { if (L + 1 == R)return cost[L][R]; ll &ret = d[L][R]; if (~ret)return ret; ret = cost[L][R]; fup(i, L + 2, R - 1,2)ret = min(ret, go(L, i - 1) + go(i, R)); return ret; } int main() { MEM_1(d); scanf("%d", &n); if (n > 1000)return !printf("-1"); n <<= 1; fup(i, 0, n-1, 1)scanf("%lld%lld", &p[i].X, &p[i].Y),p[i].X--; sort(p, p + n); fup(i, 0, n - 1, 2)cost[i][i + 1] = res(i, i + 1, i / 2); fup(i, 1, n - 2, 2) { ll tmp = 0; fup(j, i, n - 2, 2) { tmp += res(j, j + 1, (j + 1) / 2); cost[i - 1][j + 2] = tmp + res(i - 1, j + 2, i / 2); } } printf("%lld\n", go(0, n - 1)); }

Compilation message (stderr)

joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:81:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
joi2019_ho_t4.cpp:84:54: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fup(i, 0, n-1, 1)scanf("%lld%lld", &p[i].X, &p[i].Y),p[i].X--;
                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...