fork download
copy 
  1. #include <iostream>
  2. #include <vector>
  3. using namespace std;
  4.  
  5. int main() {
  6. 	std::ios_base::sync_with_stdio(0);
  7. 	std::cin.tie(0);
  8. 	std::cout.tie(0);
  9. 	int i, j;
  10. 	int ile_paneli = 0;
  11. 	long long dlugosc = 0;
  12. 	int ile_rzedow;
  13.  
  14. 	cin >> ile_rzedow;
  15.  
  16. 	dlugosc = 0;
  17.  
  18. 	int kolejne_panele[500001];
  19. 	for(int i=0; i<500001;i++){
  20. 		kolejne_panele[i]=0;
  21. 	}
  22.  
  23. 	for (i = 1; i <= ile_rzedow; i++){
  24. 		cin >> ile_paneli;
  25. 		dlugosc = 0;
  26. 		for (j = 0; j < ile_paneli; j++){
  27. 			int panel;
  28. 			cin >> panel;
  29. 			dlugosc = dlugosc + panel;
  30. 			cout <<"panel "<<panel<< " dl "<<dlugosc<<endl;
  31. 			kolejne_panele[dlugosc]=kolejne_panele[dlugosc]+1;
  32. 		}
  33. 	}
  34. 	long long min = 500000, maks = 0;
  35. 	for (i = 1; i < dlugosc; i++){
  36. 		if (kolejne_panele[i] > maks) {
  37. 			maks = kolejne_panele[i];
  38. 		}
  39. 		if (kolejne_panele[i] < min){
  40. 			min = kolejne_panele[i];
  41. 		}
  42. 	}
  43. 	cout << endl;
  44. 	for(int i=0; i<6;i++){
  45. 		cout << kolejne_panele[i] <<" ";
  46. 	}
  47. 	cout << endl;
  48. 	// if (ile_rzedow == 1){
  49. 	// 	cout << "0 1";
  50. 	// 	return 0;
  51. 	// }
  52. //	cout <<"dlugosc = "<<dlugosc<<" "<<min<<" "<<maks<<" ";
  53. 	cout << ile_rzedow - maks << " ";
  54. 	cout << ile_rzedow - min;
  55. 	return 0;
  56. }
Success #stdin #stdout 0.01s 5528KB
comments (?)
stdin
copy 
2
3 2 2 2
4 1 2 2 1
stdout
copy 
panel 2 dl 2
panel 2 dl 4
panel 2 dl 6
panel 1 dl 1
panel 2 dl 3
panel 2 dl 5
panel 1 dl 6

0 1 1 1 1 1 
1 1
https://ideone.com/1LkCZv
language:
C++ (gcc 8.3)
created:
3 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!