Uva 10474 - Where is the Marble?

Accepted

 // Verdict :: Accepted

/// Header file begin
#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
#include <string>
#include <vector>
#include <cmath>
#include <cctype>
#include <sstream>
#include <set>
#include <list>
#include <stack>
#include<utility>
#include <queue>
#include <algorithm>
/// End
//..........
/// Macro
#define sf scanf
#define pf printf
#define sfint(a,b) scanf("%d %d",&a,&b)
#define sfl(a,b) scanf("%ld %ld",&a,&b)
#define sfll(a,b) scanf("%lld %lld",&a,&b)
#define sfd(a,b) scanf("%lf %lf",&a,&b)
#define sff(a,b) scanf("%f %f",&a,&b)
#define lp1(i,n) for(i=0;i<n;i++)
#define lp2(i,n) for(i=1;i<=n;i++)
#define mem(c,v) memset(c,v,sizeof(c))
#define cp(a) cout<<" "<<a<<" "
#define nl puts("")
#define sq(x) ((x)*(x))
#define all(x) x.begin(),x.end()
#define reall(x) x.rbegin(),x.rend()
#define sz size()
#define gc getchar()
#define pb push_back
/// End.........

/// Size
#define mx7 20000100
#define mx6 1500000
#define mx5 100005
#define mx4 1000100
#define inf 1<<30                                           //infinity value
#define eps 1e-9
#define mx (65540)
#define mod 1000000007
#define pi acos(-1.0)

/// Macros for Graph

#define white 0
#define gray 1
#define black -1
#define nil -2

using namespace std;
/***************/

/// typedef

typedef long long LL;
typedef long L;
typedef unsigned long long ull;
typedef unsigned long ul;
typedef unsigned int ui;
typedef pair<int, int> pii;
typedef vector<int>vi;
typedef vector<long long> vll;
typedef vector<long>vl;
typedef vector<char>vch;
typedef vector<string>vs;
typedef map<int,int>mpii;
typedef map<int,bool>mpbi;
typedef map<long,bool>mpbl;
typedef map<long long,bool>mpbll;
typedef map<char,int>mpci;
typedef map<char,bool>mpbc;
typedef map<string,int>mpsi;
typedef map<long long,long long>mpll;

/// template

template<class T> T gcd(T a, T b ) {return b<=0?a:gcd(b,a%b);}
template<class T> T large(T a, T b ) {return a>b?a:b;}
template<class T> T small(T a, T b ) {return a<b?a:b;}
template<class T> T diffrnce(T a, T b) {return a-b<0?b-a:a-b;}

/// macros for seieve

#define setbit(n) (prime[n>>6]|=((1<<(n>>1))&31))
#define checkbit(n) (prime[n>>6]&((1<<(n>>1))&31))

struct my
{
    L a,b;
};

my ar[mx4];

int main()
{
    vl v1;
    vector<L>v2,cv;
    L n,q,tc=0;

    while(cin >> n >> q)
    {
       if(!n and !q) break;

       L len=0;

       v1.clear();
       v2.clear();
       cv.clear();

       for(L i=0;i<n;i++)
       {
           L x;
           cin >> x;
           v1.push_back(x);
       }

       for(L i=0;i<q;i++)
       {
           L x;
           cin >> x;
           v2.push_back(x);
       }

       cv = v2;
       sort(all(v1));
       sort(all(v2));

//    for(int i=0;i<cv.size();i++)cout << cv[i] << " ";
//       nl;
//       for(int i=0;i<v2.size();i++)cout << v2[i] << " ";

       for(L i=0;i<q;i++)
       {
           for(L j=0;j<n;j++)
           {
               if(v2[i] == v1[j])
               {
                   ar[len].a=j+1;
                   ar[len++].b=v2[i];
                   break;
               }
           }
       }

       //for(int i=0;i<q;i++)cout << ar[i].a << " " << ar[i].b << " ";

       bool f;

       pf("CASE# %ld:\n",++tc);

       for(L i=0;i<cv.size();i++)
       {
           f=false;

           for(L j=0;j<len;j++)
           {
               if(cv[i] == ar[j].b)
               {
                   pf("%ld found at %ld\n",cv[i],ar[j].a);
                   f=false;
                   break;
               }

               else
               {
                   f=true;
               }
           }

           if(f)
           {
               pf("%ld not found\n",cv[i]);
           }
       }
    }

    return 0;
}