Submission #348143

#	Time	Username	Problem	Language	Result	Execution time	Memory
348143		Harry464	Fence (CEOI08_fence)	C++14	10 / 100	1 ms	620 KiB

fence

#include <iostream>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>

using namespace std;

typedef long long ll;

vector <bool> te(1000,false);
vector <vector <bool> > adjl(1000, te);

int main()
{
    ll n, m;
    cin >> n >> m;
    vector <pair<ll,ll> > h(n);
    vector <pair<ll,ll> > t(m);
    for (int i = 0; i < n; i++)
      cin >> h[i].first >> h[i].second;
    for (int i = 0; i < m; i++)
      cin >> t[i].first >> t[i].second;
    vector <ll> uh;
    vector <ll> lh;
    sort(h.begin(), h.end());
    for (int i = 0; i < n; i++){
        if (uh.size() < 2){
            uh.push_back(i);
            continue;
        }
        ll cx = h[i].first, cy = h[i].second;
        ll s = uh.size();
        while (s >= 2){
            ll bx = h[uh[s-1]].first, by = h[uh[s-1]].second;
            ll ax = h[uh[s-2]].first, ay = h[uh[s-2]].second;
            ll por = (bx-ax)*(cy-ay) - (cx-ax)*(by-ay);
            if (por > 0)
                uh.pop_back(), s--;
            else
                break;
        }
        uh.push_back(i);
    }
    for (int i = 0; i < n; i++){
        if (lh.size() < 2){
            lh.push_back(i);
            continue;
        }
        ll cx = h[i].first, cy = h[i].second;
        ll s = lh.size();
        while (s >= 2){
            ll bx = h[lh[s-1]].first, by = h[lh[s-1]].second;
            ll ax = h[lh[s-2]].first, ay = h[lh[s-2]].second;
            ll por = (bx-ax)*(cy-ay) - (cx-ax)*(by-ay);
            if (por < 0)
                lh.pop_back(), s--;
            else
                break;
        }
        lh.push_back(i);
    }
    vector <ll> tacke;
    for (int i = 0; i < uh.size(); i++)
        tacke.push_back(uh[i]);
    for (int i = lh.size() - 2; i >= 1; i--)
        tacke.push_back(lh[i]);
    vector <ll> odg;
    for (int i = 0; i < m; i++){
        bool jeste = true;
        for (int j = 0; j < uh.size() - 1; j++){
            ll bx = h[uh[j+1]].first, by = h[uh[j+1]].second;
            ll ax = h[uh[j]].first, ay = h[uh[j]].second;
            ll val = (bx-ax)*(t[i].second - ay) - (by - ay)*(t[i].first - ax);
            if (val > 0)
                jeste = false;
        }
        for (int j = 0; j < lh.size() - 1; j++){
            ll bx = h[lh[j+1]].first, by = h[lh[j+1]].second;
            ll ax = h[lh[j]].first, ay = h[lh[j]].second;
            ll val = (bx-ax)*(t[i].second - ay) - (by - ay)*(t[i].first - ax);
            if (val < 0)
                jeste = false;
        }
        if (jeste)
            odg.push_back(i);
    }
    ll bv = tacke.size();
    for (int i = 0; i < bv; i++){
        for (int j = 0; j < bv; j++){
            if (i == j)
                continue;
            ll bx = h[tacke[j]].first, by = h[tacke[j]].second;
            ll ax = h[tacke[i]].first, ay = h[tacke[i]].second;
            bool jed = true;
            for (int k = 0; k < odg.size(); k++){
               ll val = (bx-ax)*(t[odg[k]].second - ay) - (by - ay)*(t[odg[k]].second - ax);
               if (val > 0)
                 jed = false;
            }
            if (jed)
                adjl[i][j] = true;
        }
    }
    ll shortest = 10000000;
    vector <ll> tem(bv,1000000000);
    vector <vector<ll> > put(bv,tem);
    for (int i = 0; i < bv; i++)
        for (int j = 0; j < bv; j++)
          if (adjl[i][j])
           put[i][j] = 1;
    for (int i = 0; i < bv; i++){
        for (int j = 0; j < bv; j++){
            for (int k = 0; k < bv; k++){
                put[i][k] = min(put[i][k], put[i][j] + put[j][k]);
            }
        }
    }
    for (int i = 0; i < bv; i++)
        shortest = min(shortest, put[i][i]);
    cout << shortest*20 + (m - odg.size())*111;
}

Compilation message (stderr)

fence.cpp: In function 'int main()':
fence.cpp:66:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for (int i = 0; i < uh.size(); i++)
      |                     ~~^~~~~~~~~~~
fence.cpp:73:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |         for (int j = 0; j < uh.size() - 1; j++){
      |                         ~~^~~~~~~~~~~~~~~
fence.cpp:80:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |         for (int j = 0; j < lh.size() - 1; j++){
      |                         ~~^~~~~~~~~~~~~~~
fence.cpp:98:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |             for (int k = 0; k < odg.size(); k++){
      |                             ~~^~~~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 10 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10