Cheating Detection

Google Code Jam 2021 - Qualification Round
Cheating Detection

#include <algorithm>
#include <cmath>
#include <ctime>
#include <iostream>
#include <random>
#include <string>
using namespace std;

const int QC = 10000;
const int PC = 100;

struct info {
  int idx;
  int cnt;
  double lvl;
  double w;
} qs[QC + 5], ps[PC + 2];

// float ;
double prob[QC + 5];
char str[PC + 2][QC + 2];

inline bool cmp(info x, info y);
inline void get_rand(int size);
inline void set_peo_level();
inline void set_qst_level();
inline double sigmoid(double x);
inline int judge();

random_device rd;  // Will be used to obtain a seed for the random number engine
mt19937 gen(rd());  // Standard mersenne_twister_engine seeded with rd()
uniform_real_distribution<> dis(-3.0, 3.0);  //[-3.00,3.00]

int main() {
  freopen("D:\\workspace\\cheating_detection_sample_ts1_input.txt", "r", stdin);
  ios::sync_with_stdio(false), cin.tie(nullptr);
  int T, P, ans;
  cin >> T >> P;
  for (int tc = 1; tc <= T; tc++) {
    //初始化 问题
    for (int j = 0; j < QC; j++) {
      qs[j].idx = j;
      qs[j].lvl = 0;
      qs[j].cnt = 0;
      qs[j].w = 0;
    }
    // read case
    for (int i = 0; i < PC; i++) {
      cin >> str[i];
      ps[i].idx = i;
      ps[i].lvl = 0;
      ps[i].cnt = 0;
      ps[i].w = 0;
      for (int j = 0; j < QC; j++) {
        if (str[i][j] == '1')
          ps[i].cnt++;
        else
          qs[j].cnt++;
      }
    }
    //排序
    sort(ps, ps + PC, cmp);
    sort(qs, qs + QC, cmp);
    //指定人的skill level
    set_peo_level();
    //指定题目difficult level
    set_qst_level();

    ans = judge();
    cout << "Case #" << tc << ": " << ans << endl;
  }

  return 0;
}

inline bool cmp(info x, info y) { return x.cnt < y.cnt; }

inline void set_peo_level() {
  for (int i = 0; i < PC; i++) prob[i] = dis(gen);
  sort(prob, prob + PC);
  for (int i = 0; i < PC; i++) ps[i].lvl = prob[i];
}

inline void set_qst_level() {
  for (int i = 0; i < QC; i++) prob[i] = dis(gen);
  sort(prob, prob + QC);
  for (int i = 0; i < QC; i++) qs[i].lvl = prob[i];
}

inline double randD() { return (double)rand() / RAND_MAX * 6 - 3; }

// inline double sigmoid(double x) { return 1 / (1 + exp(-x)); }
inline double sigmoid(double x) { return 1.0 / (1.0 + exp(-x)); }

inline int judge() {
  int maxid = 0;
  double maxd = 0;
  for (int k = 0; k < PC; k++) {
    int id = 9999;
    for (int i = 4; i > 0; i--) {//计算最难的500个题目,5 *100
      double real = 0, hope = 0;
      for (int j = 0; j < 100 ; j++) {
        real += (str[ps[k].idx][qs[id].idx] == '1');  //实际结果
        hope += sigmoid(ps[k].lvl - qs[id--].lvl);    //期望结果
      }
      ps[k].w += abs(real - hope) * pow(i,2);//pow 当做是题目块的权值，100个题目为一块
    }
    if (ps[k].w > maxd) {  //计算期望结果和实际结果
      maxd = ps[k].w;
      maxid = ps[k].idx;
    }
  }
  return maxid + 1;
}