Submission #667570

#	Time	Username	Problem	Language	Result	Execution time	Memory
667570		berr	Roads (CEOI20_roads)	C++17	0 / 100	2 ms	2644 KiB

roads

#include <bits/stdc++.h>
using namespace std;
const int N=1e5+37;
// subtask all are vertical
vector<array<int, 2>> a[N];

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n; cin>>n;
    vector<array<int, 2>> node(2*n+1);
    vector<int> x, y;
    map<int, int> cx, cy;
    for(int i=1; i<=n*2; i+=2)
    {
        cin>>node[i][0]>>node[i][1];
        cin>>node[i+1][0]>>node[i+1][1];

        x.push_back(node[i][0]);
        x.push_back(node[i+1][0]);
        y.push_back(node[i][1]);
        y.push_back(node[i+1][1]);
    }

    sort(x.begin(), x.end());
    sort(y.begin(), y.end());


    int cnt=1;

    for(auto i: x)
    {
        if(!cx.count(i)) cx[i]=cnt, cnt++;
    }

    cnt=1;

    for(auto i: y)
    {
        if(!cy.count(i)) cy[i]=cnt, cnt++;
    }


    for(int i=1; i<=2*n; i++)
    {
        a[cy[node[i][1]]].push_back({cx[node[i][0]], i});
    }


    for(int i=0; i<N; i++)
    {
        if(a[i].size())
        {
            sort(a[i].begin(), a[i].end());
        }
    }

    vector<array<int, 4>> ans;
    for(int i=1; i<N; i++)
    {
        if(a[i].size()){
        for(int l=1; l<a[i].size()-1; l+=2)
        {
            int v=a[i][l][1];
            int u=a[i][l+1][1];

            ans.push_back({node[v][0], node[v][1], node[u][0], node[u][1]});
        }
        if(!a[i+1].size()) break;


        int v=a[i][0][1];
        int u=a[i+1][0][1];
            ans.push_back({node[v][0], node[v][1], node[u][0], node[u][1]});

    }
    }


    for(auto i: ans) cout<<i[0]<<" "<<i[1]<<" "<<i[2]<<" "<<i[3]<<"\n";

}

Compilation message (stderr)

roads.cpp: In function 'int main()':
roads.cpp:64:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |         for(int l=1; l<a[i].size()-1; l+=2)
      |                      ~^~~~~~~~~~~~~~

• Subtask 1: 0 / 0
• Subtask 2: 0 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 40