제출 #1091169

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1091169		Izzy	Advertisement 2 (JOI23_ho_t2)	C++14	0 / 100	0 ms	348 KiB

Main

#include <iostream>
#include <vector>
#include <queue>
using namespace std;

int n;
vector<int> visited;
vector<pair<int, int>> res;
//just count how many graphs there are
void traverse(int start) {
    queue<int> q;
    q.push(start);
    visited[start] = false;
    int a;
    while (!q.empty()) {
        a = q.front();
        q.pop();
        for (int i = -1 * res[a].second; i <= res[a].second; i++) {
            if (a + i >= 0 && a + i < n) {
                if (!visited[a + i] && abs(res[a].first - res[a + i].first) <= res[a].second - res[a + i].second) {
                    visited[a + i] = true;
                    q.push(a + i);
                }
                else {
                    continue;
                }
            }
            else {
                break;
            }
        }
    }
}

int main() {
    cin >> n;
    pair<int, int> temp;
    for (int i = 0; i < n; i++) {
        cin >> temp.first;
        cin >> temp.second;
        res.push_back(temp);
        visited.push_back(false);
    }
    int count = 0;
    for (int i = 0; i < n; i++) {
        if (!visited[i]) {
            traverse(i);
            count++;
        }
    }
    cout << count;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 23
• Subtask 3: 0 / 36
• Subtask 4: 0 / 31