Advertisement
Guest User

Untitled

a guest
Dec 13th, 2019
93
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.52 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. #define Nmax 100005
  3. using namespace std;
  4.  
  5. ifstream fin ("teste.in");
  6. ofstream fout ("teste.out");
  7.  
  8. int n, m, lg, minn, p[Nmax], poz, x, y, f[Nmax];
  9. int main()
  10. {
  11. fin >> n >> m >> lg >> minn; /// lg = lungimea lantului raspuns; minn=raspunsul tau;
  12. fout << n << ' ' << m << '\n';
  13. srand(time(NULL));
  14.  
  15. for(int i=1;i<=n;i++)
  16. p[i]=i;
  17. random_shuffle(p+2, p+n);
  18. swap(p[lg], p[n]);
  19. poz=rand()%(lg-1)+1;
  20. for(int i=1;i<lg;i++)
  21. {
  22. /*v[m].c=rand()%minn+1;
  23. v[m].x=p[i];
  24. v[m].y=p[i+1];
  25. f[p[i]]=f[p[i+1]]=1;*/
  26. fout << p[i] << ' ' << p[i+1] << ' ';
  27. f[p[i]]=f[p[i+1]]=1;
  28. if(i==poz)
  29. fout << minn << '\n';
  30. else fout << rand()%minn+1 << '\n';
  31. m--;
  32. }
  33. for(int i=lg+1;i<=n;i++)
  34. {
  35. fout << rand()%(i-1)+1 << ' ' << p[i] << ' ' << rand()%(minn-1)+1 << '\n';
  36. /*v[m].c=rand()%minn+1;
  37. v[m].x=ha;
  38. v[m].y=p[i]; */
  39. m--;
  40. }
  41. while(m)
  42. {
  43. /*v[m].x=rand()%n+1;
  44. v[m].y=rand()%n+1;
  45. if(f[v[m].x]==0&&f[v[m].y]==0)
  46. v[m].c=rand()%1000000+1;
  47. else v[m].c=rand()%(1000000-minn-1)+(minn+1);*/
  48. x=rand()%n+1;
  49. y=rand()%n+1;
  50. if(x==y)
  51. continue;
  52. fout << x << ' ' << y << ' ';
  53. if(f[x]==0 && f[y]==0)
  54. fout << rand()%1000000+1 << '\n';
  55. else fout << rand()%(1000000-minn-1)+(minn+1) << '\n';
  56. m--;
  57. }
  58. return 0;
  59. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement