fork download 
  1. /*
  2. * @problem: ICPC16F
  3. */
  4.  
  5. #include <iostream>
  6. #include <cstring>
  7. #include <cstdio>
  8. #include <iomanip>
  9. #include <cmath>
  10. #include <limits.h>
  11. #include <vector>
  12. #include <map>
  13. #include <bitset>
  14. #include <string>
  15. #include <iterator>
  16. #include <set>
  17. #include <utility>
  18. #include <queue>
  19. #include <numeric>
  20. #include <functional>
  21. #include <ctype.h>
  22. #include <stack>
  23. #include <algorithm>
  24. #include <cstdlib>
  25. #define MAX 100100
  26. #define mod 1000000007LL
  27. #define bitcnt(x) __builtin_popcountll(x)
  28. #define MS0(x) memset(x, 0, sizeof(x))
  29. #define MS1(x) memset(x, -1, sizeof(x))
  30. #define ll long long int
  31. #define mp(x, y) make_pair(x, y)
  32. #define pii pair<int, int>
  33. #define pll pair<ll, ll>
  34. #define in(x) scanf("%lld", &x)
  35. #define ind(x) scanf("%d", &x)
  36. #define ins(x) scanf("%s", x)
  37. #define pr(x) printf("%lld\n", x)
  38. #define prd(x) printf("%d\n", x)
  39. #define pi acos(-1.0)
  40. #define ff first
  41. #define ss second
  42.  
  43. using namespace std;
  44. int n, m, d, D, inL[110], inR[110];
  45. bool vis[110][110];
  46. vector<pii> edge;
  47.  
  48. int main() {
  49. 	#ifdef LOCAL_PROJECT
  50. 		freopen("../input.txt", "r", stdin);
  51. 		freopen("../output1.txt", "w", stdout);
  52. 	#endif
  53. 	// ios_base::sync_with_stdio(0);
  54.     // cin.tie(0);
  55. 	int t;
  56. 	ind(t);
  57. 	while (t--) {
  58. 		edge.clear();
  59. 		priority_queue<pii, vector<pii>, greater<pii> > q;
  60. 		MS0(inL);
  61. 		MS0(inR);
  62. 		MS0(vis);
  63. 		ind(n);
  64. 		ind(m);
  65. 		ind(d);
  66. 		ind(D);
  67. 		//cerr << n << " " << m << " " << d << " " << D << endl;
  68. 		if ((m < (d * n)) || (m > (D * n))) {
  69. 			printf("-1\n");
  70. 			continue;
  71. 		}
  72. 		int c = m / n;
  73.  
  74. 		bool flag = 0;
  75. 		for (int i = 1; i <= n && m > 0; i++) {
  76. 			while(!q.empty())
  77. 				q.pop();
  78. 			for (int j = 1; j <= n; j++)
  79. 				q.push(mp(inR[j], j));
  80. 			while(inL[i] < c && !q.empty() && m > 0) {
  81. 				pii cur = q.top();
  82. 				q.pop();
  83. 				if(vis[i][cur.ss] || inR[i] == c)
  84. 					continue;
  85. 				edge.push_back(mp(i, cur.ss));
  86. 				inR[cur.ss]++;
  87. 				vis[i][cur.ss] = 1;
  88. 				inL[i]++;
  89. 				m--;
  90. 			}
  91. 		}
  92. 		for (int i = 1; i <= n && m > 0; i++) {
  93. 			int c = 0;
  94. 			while(!q.empty())
  95. 				q.pop();
  96. 			for (int j = 1; j <= n; j++)
  97. 				q.push(mp(inR[j], j));
  98. 			while(inL[i] < D && !q.empty() && m > 0) {
  99. 				pii cur = q.top();
  100. 				q.pop();
  101. 				if(vis[i][cur.ss] || inR[cur.ss] == D)
  102. 					continue;
  103. 				edge.push_back(mp(i, cur.ss));
  104. 				inR[cur.ss]++;
  105. 				vis[i][cur.ss] = 1;
  106. 				inL[i]++;
  107. 				m--;
  108. 			}
  109. 		}
  110. 		for (int i = 1; i <= n; i++) {
  111. 			//cout << in[i] << " ";
  112. 			if (inL[i] < d || inL[i] > D || inR[i] < d || inR[i] > D) {
  113. 				flag = 1;	
  114. 			}
  115. 		}
  116. 		//cout << endl;
  117. 		if (m != 0 || flag) {
  118. 			printf("-1\n");
  119. 			continue;
  120. 		}
  121. 		for (int i = 0; i < edge.size(); i++) {
  122. 			printf("%d %d\n", edge[i].ff, edge[i].ss);
  123. 		}
  124. 	}
  125. 	return 0;
  126. }
Runtime error #stdin #stdout 0s 3484KB
comments (?)
stdin 
Standard input is empty
stdout 
Standard output is empty
https://ideone.com/Tf3P1A
language:
C++14 (gcc 8.3)
created:
8 years ago
visibility:
secret

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!