oj.uz

Submission #237217

# Submission time Handle Problem Language Result Execution time Memory
237217 2020-06-05T09:28:57 Z Mlxa Plahte (COCI17_plahte) C++14
0 / 160
 2000 ms 11564 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define all(x) x.begin(), x.end()
#define x first
#define y second
#define mp make_pair
#define mt make_tuple

const int N = 1e5;

int n;
int m;
int a[N];
int b[N];
int c[N];
int d[N];
int x[N];
int y[N];
int k[N];

signed main() {
#ifdef LC
	assert(freopen("input.txt", "r", stdin));
#endif
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> m;
	for (int i = 0; i < n; ++i) {
		cin >> a[i] >> b[i] >> c[i] >> d[i];
	}
	for (int i = 0; i < m; ++i) {
		cin >> x[i] >> y[i] >> k[i];
	}
	for (int i = 0; i < n; ++i) {
		vector<int> v;
		for (int j = 0; j < m; ++j) {
			if (a[i] <= x[j] && x[j] <= c[i] && b[i] <= y[j] && y[j] <= d[i]) {
				v.push_back(k[j]);
			}
		}
		sort(all(v));
		cout << (unique(all(v)) - v.begin()) << "\n";
	}
	return 0;
}

Subtask #1
0 / 32.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2078 ms 4524 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 32.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2082 ms 4544 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 32.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2081 ms 7328 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2089 ms 11508 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2090 ms 11564 KB Time limit exceeded
2 Halted 0 ms 0 KB -