제출 #95959

#제출 시각아이디문제언어결과실행 시간메모리
95959MohamedAhmed0새로운 문제 (POI11_pat)C++14
28 / 100
1079 ms14304 KiB
#include <bits/stdc++.h> using namespace std; const int MAXK = 55 ; const int MAXN = 1e6+10 ; int arr[MAXK][MAXN] , sz[MAXK]; int k ; int main() { int n ; cin>>n ; for(int i = 0 ; i < n ; ++i) { cin>>sz[i] ; for(int j = 0 ; j < sz[i] ; ++j) cin>>arr[i][j] ; } for(int i = 0 ; i < n ; ++i) { for(int i2 = 0 ; i2 < sz[i] ; ++i2) { int a = arr[i][i2] ; for(int j = i+1 ; j < n ; ++j) { for(int j2 = 0 ; j2 < sz[j] ; ++j2) { int b = arr[j][j2] ; for(int k = j+1 ; k < n ; ++k) { for(int k2 = 0 ; k2 < sz[k] ; ++k2) { int c = arr[k][k2] ; if(a < b+c && b < a+c && c < a+b) return cout<<i+1<<" "<<a<<" "<<j+1<<" "<<b<<" "<<k+1<<" "<<c<<"\n" , 0 ; } } } } } } return cout<<"NIE\n" , 0 ; }
#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...
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...