阿里云c++研发实习生面试二面

// 1
#include<bits/stdc++.h>
#define LL long long
#define maxn 5010
using namespace std;

int a[maxn][maxn];

int main(){
    int n, m, t;
      scanf("%d %d %d", &n, &m, &t);
      for(int i = 0; i < n; ++i){
        for(int j = 0; j < m; ++j){
            scanf("%d", &a[i][j]);
        }
    }
      int l, r, T;
      l = 0, r = n, T = 50;
      while(l < r && T--){
        int mid = (l + r) >> 1;
          if(a[mid][0] > t){
            r = mid;
        }
          else{
            l = mid;
        }
    }
      int rl = r;
      l = 0, r = n, T = 50;
      while(l < r && T--){
        int mid = (l + r) >> 1;
          if(a[mid][m - 1] < t){
            r = mid;
        }
          else{
            l = mid;
        }
    }
      int ll = r;
      for(int i = ll; i <= rl; ++i){
        int mb = lower_bound(a[i], a[i] + m, t) - a[i];
          if(mb < m && a[i][mb] == t){
            printf("YES\n");
              return 0;
        }
    }
      printf("NO\n");
      return 0;
}

// 2
unordered_map<u32d, string> mp;

LL count = 0, MAX_SIZE = 100000000;

list<u32d> ls;

void _delete(){
    while(count > MAX_SIZE){
        count = count - mp[ls.front()].size();
          mp.erase(mp.find(ls.front()));
          ls.pop_front();
    }
}

void _push(u32d _key, string _value){
    if(mp.find(_key) != mp.end()){
        mp[_key] = _value;    
    }
    else{
        mp[_key] = _value;
          count = count + _value.size();
          ls.push_back(_key);
        if(count > MAX_SIZE){
            _delete();
        }
    }
}

string _get(u32d _key){
    return mp[_key];
}