제출 #166420

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
166420		tincamatei	Zamjena (COCI18_zamjena)	C++14	70 / 70	282 ms	18864 KiB

zamjena

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 50000;

string a[MAX_N], b[MAX_N];
map<string, vector<string> > graph;
map<string, int> vartable;
map<string, bool> viz;
bool ok = true;

void getVal(string str, int xd) {
  if(!viz[str]) {
    viz[str] = true;
    if(vartable.count(str) > 0 && vartable[str] != xd)
      ok = false;
    vartable[str] = xd;
    for(auto it: graph[str])
      getVal(it, xd);
  }
}

int main() {
  int N;
  cin >> N;
  for(int i = 0; i < N; ++i)
    cin >> a[i];
  for(int i = 0; i < N; ++i)
    cin >> b[i];

  for(int i = 0; i < N; ++i) {
    if(isalpha(a[i][0]) && isalpha(b[i][0])) {
      if(a != b) {
        graph[a[i]].push_back(b[i]);
        graph[b[i]].push_back(a[i]);
      }
    } else if(isalpha(a[i][0])) {
      int valB = atoi(b[i].c_str());
      if(vartable.count(a[i]) > 0 && vartable[a[i]] != valB)
        ok = false;
      else {
        vartable[a[i]] = valB;
      }
    } else if(isalpha(b[i][0])) {
      int valA = atoi(a[i].c_str());
      if(vartable.count(b[i]) > 0 && vartable[b[i]] != valA)
        ok = false;
      else
        vartable[b[i]] = valA;
    } else if(atoi(a[i].c_str()) != atoi(b[i].c_str()))
      ok = false;
  }

  for(auto it: vartable)
    getVal(it.first, it.second);

  if(ok)
    printf("DA");
  else
    printf("NE");

  return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 14 / 14