oj.uz

Submission #257139

# Submission time Handle Problem Language Result Execution time Memory
257139 2020-08-03T16:09:39 Z islingr Sticks (POI11_pat) C++17
100 / 100
 678 ms 4344 KB 
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)
#define ub(x...) upper_bound(x)

const int K = 1 << 6;
vector<int> s[K];

bool ckmax(auto &a, const auto &b) { return a < b ? a = b, 1 : 0; }

signed main() {
	int k; cin >> k;
	rep(i, 0, k) {
		int n; cin >> n;
		s[i].resize(n);
		for (auto &x : s[i]) cin >> x;
		sort(all(s[i]));
	}
	rep(ca, 0, k) {
		for (int a : s[ca]) {
			int b = -1, cb, c = -1, cc;
			rep(i, 0, k) {
				if (i == ca) continue;
				auto it = ub(all(s[i]), a);
				if (it == begin(s[i])) continue;
				if (ckmax(b, *prev(it))) cb = i;
			}
			if (b < 0) continue;
			rep(i, 0, k) {
				if (i == ca || i == cb) continue;
				auto it = ub(all(s[i]), b);
				if (it == begin(s[i])) continue;
				if (ckmax(c, *prev(it))) cc = i;
			}
			if (c < 0) continue;
			++ca; ++cb; ++cc;
			if (b + c > a) return cout << ca << ' ' << a << ' ' << cb << ' ' << b << ' ' << cc << ' ' << c, 0;
			--ca;
		}
	}
	cout << "NIE";
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Oczekiwano NIE

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Oczekiwano NIE
2 Correct 20 ms 384 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Oczekiwano NIE
2 Correct 28 ms 512 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Oczekiwano NIE
2 Correct 63 ms 700 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 384 KB Oczekiwano NIE
2 Correct 94 ms 888 KB Output is correct
3 Correct 86 ms 760 KB Oczekiwano NIE

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 632 KB Oczekiwano NIE
2 Correct 161 ms 1400 KB Output is correct
3 Correct 137 ms 892 KB Oczekiwano NIE

Subtask #10
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 332 ms 2296 KB Output is correct
2 Correct 223 ms 1528 KB Output is correct
3 Correct 194 ms 1272 KB Oczekiwano NIE

Subtask #11
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 344 ms 2420 KB Output is correct
2 Correct 256 ms 1656 KB Output is correct
3 Correct 293 ms 1656 KB Oczekiwano NIE

Subtask #12
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 669 ms 4344 KB Output is correct
2 Correct 351 ms 1912 KB Output is correct
3 Correct 385 ms 2168 KB Oczekiwano NIE

Subtask #13
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 678 ms 4344 KB Output is correct
2 Correct 295 ms 2252 KB Output is correct
3 Correct 515 ms 2552 KB Oczekiwano NIE