AtCoder Roulette

By -

 

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. const int high = 205;
  5.  
  6. int ar[high][high], ans[high], allC[high], mp[high][high];
  7.  
  8. struct data {
  9. int indx;
  10. int c;
  11. }sarr[high];
  12.  
  13. void sol(int N) {
  14. int C, clen=0;
  15. for(int i=0; i<N; i++) {
  16. cin >> C;
  17. allC[clen++] = C;
  18. for(int j=0; j<C; j++) {
  19. cin >> ar[i][j];
  20. }
  21. }
  22. int X, minC = 37, slen=0;
  23. cin >> X;
  24. for(int i=0; i<N; i++) {
  25. for(int j=0; j<allC[i]; j++) {
  26. if(ar[i][j] == X) {
  27. if(mp[i][j] == 0) {
  28. mp[i][j] = 1;
  29. sarr[slen].indx = i+1;
  30. sarr[slen++].c = allC[i];
  31. if(minC > allC[i]) {
  32. minC = allC[i];
  33. }
  34. }
  35. }
  36. }
  37. }
  38.  
  39. //cout << "output:\n";
  40. //for(int i=0; i<slen; i++) {
  41. //cout << sarr[i].indx << " " << sarr[i].c << "\n";
  42. //}
  43. //cout << minC << "\n";
  44. int anslen = 0;
  45. for(int i=0; i<slen; i++) {
  46. if(sarr[i].c == minC) {
  47. ans[anslen++] = sarr[i].indx;
  48. }
  49. }
  50.  
  51. cout << anslen << "\n";
  52. for(int i=0; i<anslen; i++) {
  53. cout << ans[i] << " ";
  54. }
  55. }
  56.  
  57. int main() {
  58. int N;
  59. cin >> N;
  60. sol(N);
  61. return 0;
  62. }

Comments

Post a Comment

Popular posts from this blog

SPOJ-CMG - Collecting Mango

By -
#include<iostream> #include<cstdio> #include<cstring> #include<vector> #include<queue> #include<stack> #include<map> #include<cmath> #include<algorithm> #define psb push_back #define ppb pop_back #define all(x) x.begin(),x.end() #define N 1000100 #define sf scanf #define pf printf using namespace std; typedef long long LL; typedef vector<LL>vll; LL ar[N] , num[N]; int main() {     int t , tc=0;     //cin >> t;     sf("%d",&t);     while(t--)     {         LL n, x, arlen=-1, nmlen=-1 , i , maxi=-1 , zar;         char c;         //cin >> n;         sf("%lld",&n);         //cout << "Case " << ++tc << ":\n";       ...
Read more

Hackerearth Bishu and his Girlfriend

By -
/* Lionel Messi is such a player that you may catch him, you may touch him, you may feel him and definitely you may Love him. Lionel Messi is Messi. A little Magician in this World. */ // Accepted #include<bits/stdc++.h> using namespace std; #define fast ios_base::sync_with_stdio(0) #define bfast cin.tie(0) #define outs(x) cout << x << " " #define outn(x) cout << x << "\n" #define sf scanf #define pf printf #define nl puts("") #define psb push_back #define loop0(n) for(int i=0; i<n; i++) #define loop1(n) for(int i=1; i<=n; i++) #define mpair(x , y) make_pair(x , y) #define all(x) x.begin(), x.end() #define pi acos(-1.0) #define psb push_back typedef unsigned long long ull; typedef long long LL; typedef vector<int>vii; typedef vector<LL>vll; typedef vector<string>vs; typedef map<int, int>mpii; typedef map<string, int>mpsi; typedef map<char, int>mpci; typedef map<LL, LL>mpll; cons...
Read more

Uva 10650 - Determinate Prime

By -
/*     Verdict : Accepted     Link: Determinate Prime Solution Link */ #include<bits/stdc++.h> #define limit 32009 #define sf scanf #define pf printf using namespace std; typedef long long LL; typedef vector<int>vi; int prm[limit], plen=1; bitset<limit> bs; void sieve() {     LL i,j;     bs.set();     bs[1] = bs[0] = 0;     for(i=2; i<limit; i++)     {         if(bs[i])         {             if(i != 2)             {                 prm[plen++] = i;             }          ...
Read more