fork download
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. struct seq{
  5. long long int n;
  6. vector<long long int> s;
  7. long long int sum;
  8. };
  9.  
  10. int main(){
  11. ios_base::sync_with_stdio(false);
  12. cin.tie(NULL);
  13. long long int k;
  14. cin>>k;
  15.  
  16. seq in[k];
  17. long long int x;
  18.  
  19. for(long long int i=0;i<k;i++){
  20. cin>>x;
  21. (in[i].n)=x;
  22. (in[i]).sum=0;
  23. for(long long int j=0;j < (in[i].n);j++){
  24. cin>>x;
  25. ((in[i]).s).push_back(x);
  26. ((in[i]).sum)+=x;
  27. }
  28. }
  29.  
  30. vector<long long int> dp[k];
  31.  
  32. for(long long int i=0;i<k;i++){
  33. for(long long int j=0;j < (in[i].n) ;j++){
  34. (dp[i]).push_back( (in[i].sum) - ((in[i].s)[j]) );
  35. }
  36. }
  37.  
  38. long long int found=0;
  39. long long int si,di,sj,dj;
  40.  
  41. for(long long int i=0;i<k-1;i++){
  42. for(long long int j=i+1;j<k;j++){
  43. for(vector<long long int>::iterator it=dp[i].begin();it!=dp[i].end();it++){
  44. vector<long long int>::iterator it2=find(dp[j].begin(),dp[j].end(),*it);
  45. if(it2 != dp[j].end()) {
  46. si=i+1;
  47. sj=j+1;
  48. di=it-dp[i].begin()+1;
  49. dj=it2-dp[j].begin()+1;
  50. found=1;
  51. }
  52. }
  53. }
  54. if(found==1) break;
  55. }
  56.  
  57.  
  58. if(found==1){
  59. cout<<"YES"<<endl;
  60. cout<<si<<" "<<di<<"\n";
  61. cout<<sj<<" "<<dj<<"\n";
  62. }
  63. else cout<<"NO"<<"\n";
  64.  
  65. return 0;
  66. }
  67.  
Time limit exceeded #stdin #stdout 5s 4197068KB
stdin
Standard input is empty
stdout
Standard output is empty