제출 #982049

#제출 시각아이디문제언어결과실행 시간메모리
982049asdasdqwerPlahte (COCI17_plahte)C++14
0 / 160
2058 ms3644 KiB
#include <bits/stdc++.h>
using namespace std;

#define pii array<int,2>
#define tii array<int,3>

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

    int n,m;cin>>n>>m;
    vector<array<pii, 2>> v(n);
    for (auto &x:v) {
        cin>>x[0][0]>>x[0][1]>>x[1][0]>>x[1][1];
    }

    vector<tii> pts(m);

    for (auto &x:pts) {
        cin>>x[0]>>x[1]>>x[2];

        assert(x[2] <= 2*m);
    }

    for (auto &x:v) {
        vector<int> vv;
        for (auto &y : pts) {
            if (x[0][0] > y[0] || y[0] > x[1][0]) continue;
            if (x[0][1] > y[1] || y[1] > x[1][1]) continue;
            vv.push_back(y[2]);
        }

        sort(vv.begin(), vv.end());
        vv.erase(unique(vv.begin(), vv.end()), vv.end());
        cout<<vv.size()<<"\n";
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...