提出 #8358090
ソースコード 拡げる
#include <bits/stdc++.h>
#define MAX 100010
using namespace std;
vector<pair<int, int>> tri;
void getTri(int l, int r)
{
if (l + 1 == r)
{
tri.push_back({l, r});
return;
}
if (l + 3 == r)
{
tri.push_back({l, r - 1});
tri.push_back({l + 1, r});
return;
}
int n = ((r - l + 1) / 2 + 1) / 2;
for (int i = 0; i < n; i++) tri.push_back({l + i, r - (n - 1) + i});
int m = (l + r + 1) / 2;
for (int i = m; i <= r - n; i++) tri.push_back({l + n + i - m, i});
}
int mycmp(const pair<int, int> a, const pair<int, int> b)
{
return a.first + a.second < b.first + b.second;
}
int main(void)
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int N, K;
cin >> N >> K;
if (2 * K - 2 > N - 1)
{
cout << -1 << endl;
return 0;
}
getTri(K, K + 2 * N - 1);
sort(tri.begin(), tri.end(), mycmp);
for (int i = 0; i < N; i++) cout << tri[i].first << " " << tri[i].second << " " << K + 2 * N + i << "\n";
return 0;
}
提出情報
| 提出日時 | |
|---|---|
| 問題 | E - Non-triangular Triplets |
| ユーザ | didgogns |
| 言語 | C++14 (GCC 5.4.1) |
| 得点 | 700 |
| コード長 | 985 Byte |
| 結果 | AC |
| 実行時間 | 44 ms |
| メモリ | 3188 KiB |
ジャッジ結果
| セット名 | Sample | All | ||||
|---|---|---|---|---|---|---|
| 得点 / 配点 | 0 / 0 | 700 / 700 | ||||
| 結果 |
|
|
| セット名 | テストケース |
|---|---|
| Sample | sample01.txt, sample02.txt |
| All | sample01.txt, sample02.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, sample01.txt, sample02.txt |
| ケース名 | 結果 | 実行時間 | メモリ |
|---|---|---|---|
| in01.txt | AC | 41 ms | 2932 KiB |
| in02.txt | AC | 43 ms | 3060 KiB |
| in03.txt | AC | 42 ms | 3060 KiB |
| in04.txt | AC | 43 ms | 3060 KiB |
| in05.txt | AC | 40 ms | 2932 KiB |
| in06.txt | AC | 40 ms | 2932 KiB |
| in07.txt | AC | 41 ms | 3060 KiB |
| in08.txt | AC | 40 ms | 2932 KiB |
| in09.txt | AC | 39 ms | 2932 KiB |
| in10.txt | AC | 43 ms | 3188 KiB |
| in11.txt | AC | 39 ms | 2932 KiB |
| in12.txt | AC | 40 ms | 2932 KiB |
| in13.txt | AC | 43 ms | 3188 KiB |
| in14.txt | AC | 38 ms | 2804 KiB |
| in15.txt | AC | 39 ms | 2932 KiB |
| in16.txt | AC | 42 ms | 3060 KiB |
| in17.txt | AC | 43 ms | 3188 KiB |
| in18.txt | AC | 34 ms | 2548 KiB |
| in19.txt | AC | 38 ms | 2804 KiB |
| in20.txt | AC | 43 ms | 3060 KiB |
| in21.txt | AC | 1 ms | 256 KiB |
| in22.txt | AC | 1 ms | 256 KiB |
| in23.txt | AC | 43 ms | 3060 KiB |
| in24.txt | AC | 1 ms | 256 KiB |
| in25.txt | AC | 24 ms | 1912 KiB |
| in26.txt | AC | 22 ms | 1656 KiB |
| in27.txt | AC | 11 ms | 1020 KiB |
| in28.txt | AC | 17 ms | 1400 KiB |
| in29.txt | AC | 1 ms | 256 KiB |
| in30.txt | AC | 1 ms | 256 KiB |
| in31.txt | AC | 44 ms | 3188 KiB |
| in32.txt | AC | 1 ms | 256 KiB |
| in33.txt | AC | 1 ms | 256 KiB |
| in34.txt | AC | 1 ms | 256 KiB |
| sample01.txt | AC | 1 ms | 256 KiB |
| sample02.txt | AC | 1 ms | 256 KiB |