Submission #2337428

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
 
 
int main()
{
  int N;
  int a[1000];
 
  while(cin >> N, N) {
    vector< int > nums;
    for(int i = 0; i < N; i++) {
      string S;
      cin >> S;
      if(S == "x") {
        a[i] = (1 << 30);
      } else {
        a[i] = stoi(S);
        for(int j = -2; j <= 2; j++) nums.push_back(a[i] + j);
      }
    }
    sort(nums.begin(), nums.end());
    nums.erase(unique(nums.begin(), nums.end()), nums.end());
 
    int ret = 0;
    vector< int > ans;
    for(int i = 0; i < nums.size(); i++) {
      int& x = nums[i];
      bool flag = true;
      for(int j = 1; j < N; j++) {
        int prevcur = (a[j - 1] == (1 << 30) ? x : a[j - 1]);
        int realcur = (a[j] == (1 << 30) ? x : a[j]);
        if(j & 1) flag &= prevcur < realcur;
        else flag &= prevcur > realcur;
      }
      ret += flag;
      if(flag) ans.push_back(nums[i]);
    }
    if(ret == 0) cout << "none" << endl;
    else if(ret == 1) cout << ans[0] << endl;
    else cout << "ambiguous" << endl;
  }
}

Submission Info

Judge Result