Submission #914617

#	Time	Username	Problem	Language	Result	Execution time	Memory
914617		davitmarg	Towers (NOI22_towers)	C++17	11 / 100	869 ms	122364 KiB

Main

/*
DavitMarg
In a honky-tonk,
Down in Mexico
*/
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <random>
#include <chrono>
#define mod 998244353ll
#define LL long long
#define LD long double
#define MP make_pair    
#define PB push_back
#define all(v) v.begin(), v.end()
#define fastIO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;

const int N = 1000006;

#define X first.first
#define Y first.second
#define I second
#define pt pair<pair<int,int>, int>

int n, k;
int ans[N];
pt p[N];
vector<pt> x[N], y[N];
int used[N], used_x[N], used_y[N];

void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> p[i].X >> p[i].Y;
        k = max(k, max(p[i].X, p[i].Y));
        p[i].I = i;
        y[p[i].Y].PB(p[i]);
        x[p[i].X].PB(p[i]);
    }

    for (int i = 1; i <= k; i++)
    {
        sort(all(x[i]), [](pt a, pt b) {return a.Y < b.Y; });
        sort(all(y[i]), [](pt a, pt b) {return a.X < b.X; });
    }

    for (int i = 1; i <= k; i++)
    {
        int l = 0;
        int r = y[i].size() - 1;

        if(y[i].empty())
			continue;

        while(l < y[i].size() && used_x[y[i][l].X] > 0 && x[y[i][l].X].back() != y[i][l])
			l++;

        while(r >= 0 && used_x[y[i][r].X] > 0 && x[y[i][r].X].back() != y[i][r])
            r--;

        if(l > r)
            continue;

        ans[y[i][l].I] = 1;
        ans[y[i][r].I] = 1;
        used_x[y[i][l].X]++;
        used_x[y[i][r].X]++;
    }

    for (int i = 1; i <= n; i++)
        cout << ans[i];
    cout << endl;

}


int main()
{
    fastIO;
    int T = 1;
    //cin >> T;
    while (T--)
    {
        solve();
    }

    return 0;
}

/*


*/

Compilation message (stderr)

Main.cpp: In function 'void solve()':
Main.cpp:72:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |         while(l < y[i].size() && used_x[y[i][l].X] > 0 && x[y[i][l].X].back() != y[i][l])
      |               ~~^~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 0 / 11
• Subtask 3: 0 / 7
• Subtask 4: 6 / 6
• Subtask 5: 0 / 31
• Subtask 6: 0 / 21
• Subtask 7: 0 / 19