NEERC/database/database_gk_ok_cpp_full_compact.cpp

   1 #include <iostream>
   2 #include <fstream>
   3 #include <string>
   4 #include <vector>
   5 #include <algorithm>
   6 #include <map>
   7
   8 using namespace std;
   9
  10 int main() {
  11     ifstream in; in.open("database.in");
  12     ofstream out; out.open("database.out");
  13
  14     int n;
  15     int m;
  16     in >> n >> m;
  17     in.ignore();
  18
  19     cout << n << endl;
  20     pair<string, int>* pairs = new pair<string, int>[n * m];
  21     for (int i = 0; i < n; i++) {
  22         char buffer[100];
  23
  24         for (int j = 0; j < m - 1; j++) {
  25             in.getline(buffer, sizeof(buffer) / sizeof(char), ',');
  26             pairs[j * n + i] = pair<string, int>(buffer, j * n + i);
  27         }
  28
  29         in.getline(buffer, sizeof(buffer) / sizeof(char), '\n');
  30         pairs[(m - 1) * n + i] = pair<string, int>(buffer, (m - 1) * n + i);
  31     }
  32
  33     sort(pairs, pairs + n * m);
  34
  35     int* a = new int[n * m];
  36     int index = 0;
  37     string prev = "";
  38     for (int i = 0; i < n * m; i++) {
  39         if (prev != pairs[i].first) {
  40             prev = pairs[i].first;
  41             index++;
  42         }
  43         a[pairs[i].second] = index;
  44     }
  45
  46     for (int c1 = 0; c1 < m; c1++) {
  47         for (int c2 = c1 + 1; c2 < m; c2++) {
  48             int* col1 = a + c1 * n;
  49             int* col2 = a + c2 * n;
  50             for (int r1 = 0; r1 < n; r1++) {
  51                 int val1 = col1[r1];
  52                 int val2 = col2[r1];
  53                 for (int r2 = r1 + 1; r2 < n; r2++) {
  54                     if (val1 == col1[r2] && val2 == col2[r2]) {
  55                         out << "NO" << endl;
  56                         out << (r2 + 1) << " " << (r1 + 1) << endl;
  57                         out << (c1 + 1) << " " << (c2 + 1) << endl;
  58                         return 0;
  59                     }
  60                 }
  61             }
  62         }
  63     }
  64
  65     out << "YES" << endl;
  66
  67     in.close();
  68     out.close();
  69
  70     return 0;
  71 }