제출 #1333493

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1333493		santi3223	새로운 문제 (POI11_pat)	C++20	28 / 100	1097 ms	24812 KiB

pat

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vl vector<ll>
#define ff(aa, bb, cc) for(ll aa = bb; aa < cc; aa++)
#define pb push_back
#define all(aaa) aaa.begin(), aaa.end()
#define rall(aaa) aaa.rbegin(), aaa.rend()
#define pll pair<ll, ll>
#define fi first
#define se second
#define vb vector<bool>
#define ed "\n"
#define vs vector<string>

int main(){
	//brute force
	ll q;
	cin >> q;
	vector<vl> sticks(q);
	vector<pll> arr;
	vl start(q);
	ff(i, 0, q){
		ll n;
		cin >> n;
		start[i] = arr.size();
		while(n--){
			ll x;
			cin >> x;
			sticks[i].pb(x);
			arr.pb({i, x});
		}
	}
	ff(i, 0, start[q-2]){
		ll st = arr[i].se;
		ff(j, start[arr[i].fi+1], start[q-1]){
			ll mid = arr[j].se;
			ff(k, start[arr[j].fi+1], arr.size()){
				ll en = arr[k].se;
				if(st+mid > en && mid+en > st && st+en > mid){
					cout << arr[i].fi+1 << " " << st << " " << arr[j].fi+1 << " " << mid << " " << arr[k].fi+1 << " " << en;
					return 0;
				}
			}
		}
	}
	cout << "NIE";
	
	
}

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 7 / 7
• Subtask 4: 7 / 7
• Subtask 5: 0 / 8
• Subtask 6: 0 / 8
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 8
• Subtask 10: 0 / 8
• Subtask 11: 0 / 8
• Subtask 12: 0 / 8
• Subtask 13: 0 / 8